#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;
const int M = 500;
const int inf = 1e9;

int n;
char s[N];
vector <int> G[N];

int f[N][2], g[N][2];
int ans[N], cnt[N];

void dfs(int u, int fa, int k)
{
	f[u][0] = g[u][0] = 0;
	f[u][1] = g[u][1] = 1;
	for(auto v : G[u])
	{
		if(v == fa) continue;
		dfs(v, u, k);
		if(f[v][0] < f[v][1] + k) f[u][0] += f[v][0], g[u][0] += g[v][0];
		else f[u][0] += f[v][1] + k, g[u][0] += g[v][1];
		if(f[v][0] < f[v][1]) f[u][1] += f[v][0], g[u][1] += g[v][0];
		else f[u][1] += f[v][1], g[u][1] += g[v][1] - 1;
//		f[u][0] += min(f[v][0], f[v][1] + k);
//		f[u][1] += min(f[v][0], f[v][1]);
	}
	if(s[u] == '1') f[u][0] = inf;
	
	if(u == 1)
	{
		if(f[u][0] < f[u][1] + k) ans[k] = f[u][0], cnt[k] = g[u][0];
		else ans[k] = f[u][1] + k, cnt[k] = g[u][1];
	}
	return;
}

void solve(int l, int r)
{
	if(l + 1 >= r) return;
	if(cnt[l] == cnt[r])
	{
		for(int i = l + 1; i <= r; i++)
			cnt[i] = cnt[i - 1], ans[i] = ans[i - 1] + cnt[i];
		return;
	}
	int mid = (l + r) >> 1; dfs(1, 0, mid);
	solve(l, mid), solve(mid, r);
	return;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	
	cin >> n >> (s + 1);
	for(int i = 1, u, v; i < n; i++)
		cin >> u >> v, G[u].push_back(v), G[v].push_back(u);
	dfs(1, 0, 1), dfs(1, 0, n);
	solve(1, n);
	for(int i = 1; i <= n; i++) cout << ans[i] << '\n';
	return 0;
}