#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cmath>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
long long t,n,m,k,fl[1000005],br[2000005],v1,v2,bl[2000005],ans[2000005],counter,cr;
priority_queue < pair<long long, long long> > q;
pair<long long, long long> p,p1,p2;
vector <long long> v[2000005],w[2000005];
string s;

void rec1(long long vr,long long lastb){
	long long i,vr2,lb=lastb; 
	fl[vr]=1;
	//cout<<"vr="<<vr<<endl;
	if(s[vr-1]=='1'){w[lastb].push_back(vr); lb=vr;}//cherni
	for(i=0;i<v[vr].size();i++){
		vr2=v[vr][i];
		if(fl[vr2]==0){rec1(vr2,lb); br[vr]+=br[vr2];}
	}
	if(s[vr-1]=='0')br[vr]++;//br beli
	if(s[vr-1]=='1')bl[lastb]-=br[vr];
	bl[vr]+=br[vr];
	//cout<<"vr="<<vr<<" "<<br[vr]<<" "<<bl[vr]<<endl;
}
int main(){
int i,j;
ios_base::sync_with_stdio(false); cin.tie(NULL);
freopen ("monyo.in","rt",stdin);
freopen ("monyo.out","wt",stdout);
cin>>n;
for(i=1;i<n;i++){
	//scanf("%lld %lld",&v1,&v2);
	cin>>v1>>v2;
	v[v1].push_back(v2);
	v[v2].push_back(v1);
}
cin>>s; s="1"+s;
rec1(1,0); 

p.first=bl[1]; p.second=1; q.push(p);
while(!q.empty()){
	p=q.top(); q.pop();
	//cout<<p.second<<" "<<p.first<<" "<<counter<<endl;
	v1=p.second; ans[1+counter]--; counter+=(bl[v1]+1);
	for(i=0;i<w[v1].size();i++){p2.second=w[v1][i]; p2.first=bl[p2.second]; q.push(p2);}
}
cr=-1;
for(i=2;i<=n;i++){
	cr+=ans[i];
	printf("%lld\n",(i+cr));
}

return 0;
}
/*
16
1 2
1 3
2 4 
2 5
3 6
3 7
4 8
5 10
5 11
7 12
7 13
8 9
9 14
11 15
15 16
100001100100000
*/