# include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
bool t[maxn];
vector <int> p[maxn];
bool vis[maxn];
vector <int> g[1005];
int l[1005][1005];
int br[1005];
int w[1005];
int num = 1;
void dfs(int v, int last)
{
    vis[v] = 1;

    int i,j;
    if(t[v]==1)
    {
        num++;
        g[last].push_back(num);
        last = num;
    }
    else
    {
        if(v!=1)
         br[last]++;
    }

    for(i=0;i<p[v].size();i++)
    {
        if(vis[p[v][i]])continue;
        dfs(p[v][i],last);

    }
}
int sup[1005];
int maxit(int a, int b)
{
    if(a>b)return a;
    return b;
}
void calc(int v)
{
    int i;
    w[v] = 1;

        l[v][1] = br[v];
    if(v==1)l[v][0]=br[v];
    int p,q;
    for(i=0;i<g[v].size();i++)
    {
        int u = g[v][i];
        calc(u);
        for(p=1;p<=w[u]+w[v];p++)
            sup[p] = 0;
        for(p=1-(v==1);p<=w[v];p++)
            for(q=0;q<=w[u];q++)
        {
            sup[p+q] = maxit(sup[p+q],l[v][p]+l[u][q]);
        }  w[v]+=w[u];
        for(p=1;p<=w[v];p++)
            l[v][p]=sup[p];

    }
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("monyo.in","r",stdin);
freopen("monyo.out","w",stdout);
    int n,a,b,i,j;
    cin>>n;
    char ch;
    for(i=1;i<n;i++)
    {
        cin>>a>>b;
        p[a].push_back(b);
        p[b].push_back(a);
    }
    for(i=2;i<=n;i++)
    {
         cin>>ch;
         t[i]=ch-'0';
    }

    dfs(1,1);
  /*  for(i=1;i<=num;i++)
    {
        cout<<i<<" "<<br[i]<<" : ";
        for(j=0;j<g[i].size();j++)
            cout<<g[i][j]<<" ";
        cout<<endl;
    }*/
    calc(1);
   /* for(i=0;i<=num;i++)
        cout<<i<<" : "<<l[1][i]<<endl;*/
        int pos = 0;
    for(i=1;i<n;i++)
    {
        while(pos<num&&pos+l[1][pos]<i)pos++;
       // cout<<i<<"&&"<<pos<<endl;
        cout<<min(l[1][pos],i-pos)<<endl;
    }
}