#include<bits/stdc++.h>
using namespace std;

bool valid(char c)
{
    return '0'<=c&&c<='9';
}

void read_int(int &ret)
{
    ret=0;

    char c=getchar();

    while(valid(c)==0)c=getchar();

    while(valid(c))
    {
        ret=ret*10+c-'0';
        c=getchar();
    }
}

const int nmax=1e6+42;

int n,inp[nmax];

int outp[nmax];

vector<int> adj[nmax],before[nmax];

vector<int> my_merge(vector<int> a,vector<int> b)
{
    vector<int> ret(a.size()+b.size()-1,-n-5);

    for(int i=0;i<a.size();i++)
        for(int j=0;j<b.size();j++)
            ret[i+j]=max(ret[i+j],a[i]+b[j]);

    return ret;
}

int coeff[nmax];

vector<int> dfs(int node,int parent)
{
    vector<int> ret={};
    if(inp[node]==0)
    {
        ret.push_back(coeff[node]);
        for(auto w:adj[node])
            if(w!=parent)
            {
                ret=my_merge(ret,dfs(w,node));
            }
    }
    else
    {
        ret.push_back(coeff[node]);
        for(auto w:adj[node])
            if(w!=parent)
            {
                ret=my_merge(ret,dfs(w,node));
            }
        ret.insert(ret.begin(),0);
    }

    //cout<<node<<" -> ";for(auto w:ret)cout<<w<<" ";cout<<endl;

    return ret;
}

int actual[nmax];

pair<int,int> st[nmax];

int pointer=0;

void go()
{
    pointer=1;
    st[pointer]={1,1};

    int tp=1;

    while(tp<=pointer)
    {
        int node=st[tp].first;
        int par=st[tp].second;

        tp++;

        //cout<<"go "<<node<<" "<<par<<endl;

    actual[node]=node;

    if(inp[node]==0)
    {
        actual[node]=actual[par];
        coeff[actual[par]]+=coeff[node];
    }

    //cout<<node<<" -> "<<actual[node]<<endl;

    for(auto w:before[node])
        if(w!=par)
        {
            pointer++;
            st[pointer]={w,node};
        }
    }
}
void compress()
{
    go();

    for(int i=1;i<=n;i++)
        for(auto k:before[i])
            if(actual[i]!=actual[k])
            {
                adj[actual[i]].push_back(actual[k]);
                //cout<<"edges: "<<actual[i]<<" "<<actual[k]<<endl;
            }
}

int main()
{

    freopen("monyo.in","r",stdin);
    freopen("monyo.out","w",stdout);

    //n=1e6;
    read_int(n);

    for(int i=1;i<n;i++)
    {
        int u,v;

        read_int(u);
        read_int(v);

        /*
        u=i;
        v=i+1;
        */

        before[u].push_back(v);
        before[v].push_back(u);
    }

    for(int i=2;i<=n;i++)
    {
        char c=getchar();
        while(c!='0'&&c!='1')c=getchar();

        /*
        char c='0';
        */
        inp[i]=c-'0';

    }

    for(int i=2;i<=n;i++)coeff[i]=(!inp[i]);

    compress();

    //for(int i=1;i<=n;i++)cout<<coeff[i]<<" ";cout<<endl;

    vector<int> cur=dfs(1,0);

    int pos=0;

    for(int i=1;i<n;i++)
    {
        while(pos<cur.size()&&pos+cur[pos]<i)pos++;

        //cout<<"i= "<<i<<" pos= "<<pos<<endl;

        outp[i]=i-pos;

        outp[i]=max(outp[i],0);
    }

    for(int i=1;i<n;i++)printf("%i\n",outp[i]);

    return 0;
}