#pragma GCC optimize("Ofast","inline")
#include<bits/stdc++.h>
using namespace std;
const int N=4e5+50;

struct edge
{
    int u,v,nxt;
}e[N];

int n,head[N],cnt,ans,fa[N],siz[N],dep[N],tot;
char s[N];

void dfs(int x,int f)
{
    fa[x]=f;dep[x]=dep[f]+1;siz[x]=0;
    if(s[x])tot+=dep[x],siz[x]++;
    for(int i=head[x];i;i=e[i].nxt)
    {
        int v=e[i].v;
        if(v!=f)dfs(v,x),siz[x]+=siz[v];
    }

}

int chk(int x)
{
    int t=x;
    while(x){if(siz[x]<=0)return 0;x=fa[x];}
    while(t)siz[t]--,t=fa[t];
    return 1;
}

void solve(int rt)
{
    tot=0;dfs(rt,0);
    queue<int>q;q.push(rt);
    while(!q.empty())
    {
        int x=q.front();q.pop();
        if(chk(x))tot-=dep[x];
        for(int i=head[x];i;i=e[i].nxt)if(e[i].v!=fa[x])q.push(e[i].v);
    }
    cout<<tot<<' ';
}

main()
{
    // freopen("in.txt","r",stdin);
    cin>>n>>(s+1);
    for(int i=1;i<=n;i++)s[i]-='0';
    for(int i=1,u,v;i<n;i++)
    {
        cin>>u>>v;
        e[++cnt]=(edge){u,v,head[u]};head[u]=cnt;
        e[++cnt]=(edge){v,u,head[v]};head[v]=cnt;
    }
    for(int i=1;i<=n;i++)solve(i);
}