// Copyright 2026 (C) Gary0
// All rights reserved
#define debug
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
typedef long long LL;
using namespace std;
 
int n;
bool c[300005], gt[300005], ans[300005];
int sz[300005];
vector<int> g[300005];
 
void dfs(int u, int p)
{
	if (c[u]) gt[u] = 1, sz[u] = 1;
	for (auto v : g[u])
		if (v != p)
		{
			dfs(v, u), sz[u] += sz[v];
			gt[u] |= (c[v] || (gt[v] && sz[v] >= 2));
		}
}
void calc(int u, int p)
{
	ans[u] |= (c[p] || gt[u]);
	for (auto v : g[u])
		if (v != p)
		{
			if (ans[u] && (sz[1] - sz[v]) >= 2) ans[v] = 1;
			calc(v, u);
		}
}
 
int main()
{
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> c[i];
	for (int i = 1; i < n; i++)
	{
		int u, v;
		cin >> u >> v;
		g[u].push_back(v), g[v].push_back(u);
	}
	dfs(1, 0), calc(1, 0);
	for (int i = 1; i <= n; i++) cout << ans[i] << " ";
	return 0;
}