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

int main() {
	int n;
	cin>>n;
	vector<int> adjList[n+1];
	vector<int> nodeVal(n+1,0);
	vector<int> visited(n+1,0);
	vector<int> numberOfOnes(n+1,0);
	for(int i=1;i<=n-1;i++){
		int x,y;
		cin>>x>>y;
		adjList[x].push_back(y);
		adjList[y].push_back(x);
	}
	for(int i=1;i<=n;i++){
		int val;
		cin>>val;
		nodeVal[i]=val;
	}
	visited[1]=1;
	queue<int> q;
	q.push(1);
	numberOfOnes[1]=nodeVal[1];
	while(!q.empty()){
		int node=q.front();
		q.pop();
		for(auto child : adjList[node]){
			if(visited[child]==0){
				q.push(child);
				visited[child] = 1;
				if(nodeVal[child]==1)
					numberOfOnes[child]=numberOfOnes[node]+1;
				else
					numberOfOnes[child]=numberOfOnes[node];
			}
		}
			
	}
	for(int i=1;i<=n;i++){
		cout<<"node "<<i<<" : "<<numberOfOnes[i];
		cout<<"\n";
	}
	return 0;
}