//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2")
//#pragma GCC optimize("Ofast","unroll-loops","inline")
#include<bits/stdc++.h>
#define ll long long
#define int ll
#define pb push_back
#define pii pair<int,int>
#define MP make_pair
#define fi first
#define se second
using namespace std;
const int N=5e5+10,M=1e6+10,mod=998244353;
const int Inf=1e9;
int n,a[N],f[N],g[N];
char s[N];
vector<int> e[N];
void dfs(int u,int F){
	f[u]=g[u]=0;
	for(int v:e[u]) if(v!=F) dfs(v,u);
	if(a[u]){
		for(int v:e[u]) if(v!=F) g[u]=max(g[u],g[v]),f[u]+=f[v];
		g[u]++;
	}
	else{
		pii x=MP(-Inf,-Inf);
		for(int v:e[u]) if(v!=F){
			if(g[v]>x.fi) x.se=x.fi,x.fi=g[v];
			else if(g[v]>x.se) x.se=g[v];
			f[u]+=f[v];
		}
		g[u]=max(x.fi,x.se+1);
		f[u]+=x.fi;
	}
}
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	cin>>n>>(s+1);
	for(int i=1;i<=n;i++) a[i]=s[i]-'0';
	for(int i=1,u,v;i<n;i++){
		cin>>u>>v;
		e[u].pb(v),e[v].pb(u);
	}
	for(int i=1;i<=n;i++){
		dfs(i,0);
		cout<<f[i]<<' ';
	}
	return 0;
}