#include <bits/stdc++.h>

template <typename T>
void rd(T& x){
	x = 0; char c = getchar(); int f = 1;
	while(!isdigit(c)) f = c == '-' ? -1 : 1, c = getchar();
	while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
	x *= f;
}
template <typename T, typename... Args>
void rd(T& x, Args&... args){rd(x); rd(args...);}

const int N = 2e5 + 10;

int n, rt, vfa[N];
char s[N];

std::vector <int> G[N];
int dfn[N], id[N], tim;

void dfs_ord(int x, int fath){
	id[dfn[x] = ++tim] = x;
	for(auto y : G[x]) if(y != fath) dfs_ord(y, x);
}

bool fl[N];
int f[N][2], g[N][2], B, cnt[N], ret[N];

void dp(int k){
	memset(f, 0x3f, sizeof f), memset(g, 0, sizeof g);
	for(int i = n; i >= 1; --i){
		int t0 = 0, t1 = k + 1, x = id[i], g0 = 0, g1 = 1;
		for(auto y : G[x]) if(dfn[y] > i){
			if(!fl[x]){
				// t0 += std::min(f[y][0], f[y][1]);
				if(f[y][0] < f[y][1]) t0 += f[y][0], g0 += g[y][0];
				else t0 += f[y][1], g0 += g[y][1];
			}
			if(f[y][0] < f[y][1] - k) t1 += f[y][0], g1 += g[y][0];
			else t1 += f[y][1] - k, g1 += g[y][1] - 1;
		}
		if(!fl[x]) f[x][0] = t0, g[x][0] = g0;
		f[x][1] = t1, g[x][1] = g1;
	}
	if(!fl[1]){
		if(f[1][0] < f[1][1]) cnt[k] = g[1][0], ret[k] = f[1][0];
		else cnt[k] = g[1][1], ret[k] = f[1][1];
	}
	else cnt[k] = g[1][1], ret[k] = f[1][1];
}

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

int main(){
	rd(n);
	scanf("%s", s + 1);
	for(int i = 1; i <= n; ++i) fl[i] = s[i] - '0';
	for(int i = 1, u, v; i < n; ++i){
		rd(u, v), G[u].push_back(v), G[v].push_back(u);
	}
	dfs_ord(1, 0);
	dp(1), dp(n);
	solve(1, n);
	for(int i = 1; i <= n; ++i) printf("%d\n", ret[i]);
	return 0;
}