#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int maxn=1e5+7;
int n,p[maxn],v[maxn],fa[maxn],vis[maxn];
vector<int> mp[maxn];
void cal(int x){
	v[x]=1;
	for(int i=0;i<mp[x].size();i++){
		if(!v[mp[x][i]]){
			v[mp[x][i]]=1;
			fa[mp[x][i]]=x;
			cal(mp[x][i]);
		}
	}
}
int dfs(int x,int cnt){
	if(x==1) return cnt;
	if(vis[fa[x]]==1) cnt++;
	dfs(fa[x],cnt);
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1,u,v;i<n;i++){
		cin>>u>>v;
		mp[u].push_back(v);
		mp[v].push_back(u);
	}
	cal(1);
	for(int i=1;i<=n;i++) cin>>p[i];
	//for(int i=1;i<=n;i++) cout<<fa[i]<<" ";
	cout<<0<<endl;
	vis[p[1]]=1;
	for(int i=2;i<=n;i++){
		if(p[i]==1) cout<<vis[1]<<endl,vis[1]=1;
		else cout<<dfs(p[i],vis[p[i]])<<endl;
		vis[p[i]]=1;
	}
	return 0;
}