#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=200010;
int n;
char c[N];
vector<int>g[N];
#define pb push_back
int md[N];
int fa[N],lg[N],st[N][20],sz[N],d[N],dfn[N];
int cz(int x,int y){return (d[x]<d[y])?x:y;}
int lca(int u,int v){
    if(u==v)return u;if(dfn[u]>dfn[v])swap(u,v);
    int l=dfn[u]+1,r=dfn[v],k=lg[r-l+1];
    return fa[cz(st[l][k],st[r-(1<<k)+1][k])];
}
int dis(int u,int v){return d[u]+d[v]-d[lca(u,v)]*2;}
#define pi pair<int,int>
#define fi first
#define se second
pi operator + (const pi &a,const pi &b){
    if(!a.fi)return b;if(!b.fi)return a;
    int V[4]={a.fi,a.se,b.fi,b.se},mx=-1;
    pi z={0,0};
    for(int i=0;i<4;i++)for(int j=i+1;j<4;j++){
        int q=dis(V[i],V[j]);
        if(mx<q)mx=q,z={V[i],V[j]};
    }
    return z;
}
#define mp make_pair
int bel[N];
void dfs(int x){
    bel[dfn[x]=++dfn[0]]=x,sz[x]=1,st[dfn[x]][0]=x;
    for(int v:g[x])if(v!=fa[x])fa[v]=x,d[v]=d[x]+1,dfs(v),sz[x]+=sz[v];
}
pi e[N<<2];
void build(int p,int l,int r){
    if(l==r){
        if(c[bel[l]]=='1')e[p]={bel[l],bel[l]};
        else e[p]={0,0};return;
    }
    int mi=(l+r)>>1;build(p<<1,l,mi),build(p<<1|1,mi+1,r);
    e[p]=e[p<<1]+e[p<<1|1];
}
pi gr(int x,pi y){
    if(y.fi==0)return {-1,0};
    return max(make_pair(dis(y.fi,x),y.fi),make_pair(dis(y.se,x),y.se));
}
int X;pi ox;
void ask(int p,int l,int r,int x,int y){
    if(x<=l&&r<=y){ox=max(ox,gr(X,e[p]));return;}
    int mid=(l+r)>>1;
    if(x<=mid)ask(p<<1,l,mid,x,y);
    if(y>mid)ask(p<<1|1,mid+1,r,x,y);
}
void up(int p,int l,int r,int x,int z){
    if(l==r){e[p]=(z?mp(bel[l],bel[l]):mp(0,0));return;}
    int mid=(l+r)>>1;
    if(x<=mid)up(p<<1,l,mid,x,z);else up(p<<1|1,mid+1,r,x,z);
    e[p]=e[p<<1]+e[p<<1|1];
}
ll ap[N],ans[N],ax[N];int me[N];
void dfs2(int x){
    for(int v:g[x])if(v!=fa[x])dfs2(v),ap[x]+=ap[v];
    ans[x]=ax[x]=ap[x];if(c[x]=='1')return;
    X=x,ox={-1,0},ask(1,1,n,dfn[x],dfn[x]+sz[x]-1);
    if(ox.fi==-1)return;
    ap[x]+=ox.fi,me[x]=ox.se;
    up(1,1,n,dfn[ox.se],0),up(1,1,n,dfn[x],1);
}
void dfs3(int x,ll dc){
    if(me[x])up(1,1,n,dfn[x],0),up(1,1,n,dfn[me[x]],1);
    for(int v:g[x])if(v!=fa[x]){
        int jx=0;
        ll de=dc+ax[x]-ap[v];
        if(c[x]=='0'){
            X=x,ox={-1,0};
            if(dfn[v]>1)ask(1,1,n,1,dfn[v]-1);
            if(dfn[v]+sz[v]-1<n)ask(1,1,n,dfn[v]+sz[v],n);
            if(ox.fi!=-1)jx=ox.se,
            de+=ox.fi,up(1,1,n,dfn[jx],0),up(1,1,n,dfn[x],1);
        }
        ans[v]+=de;
        if(c[v]=='0'){
            int jk=(me[v]?dis(v,me[v]):0);
            X=v,ox={-1,0};
            if(dfn[v]>1)ask(1,1,n,1,dfn[v]-1);
            if(dfn[v]+sz[v]-1<n)ask(1,1,n,dfn[v]+sz[v],n);
            if(ox.fi!=-1)jk=max(jk,ox.fi);
            ans[v]+=jk;
        }
        dfs3(v,de);
        if(jx)up(1,1,n,dfn[jx],1),up(1,1,n,dfn[x],0);
    }
    if(me[x])up(1,1,n,dfn[x],1),up(1,1,n,dfn[me[x]],0);
}
int main(){
    scanf("%d%s",&n,c+1);
    lg[0]=-1;
    for(int i=1;i<=n;i++)lg[i]=lg[i>>1]+1;
    for(int i=1,u,v;i<n;i++)scanf("%d%d",&u,&v),g[u].pb(v),g[v].pb(u);
    dfs(1);
    for(int j=1;j<20;j++)for(int i=1;i+(1<<j)-1<=n;i++)st[i][j]=cz(st[i][j-1],st[i+(1<<(j-1))][j-1]);
    build(1,1,n);dfs2(1);
    ans[1]=ap[1];dfs3(1,0);
    for(int i=1;i<=n;i++)printf("%lld ",ans[i]);
    return 0;
}