#include<bits/stdc++.h>
using namespace std;
struct e{
	int nx;
	int to;
};
e edge[600015];
int f,t;
int head[300005];
int n;
int num;
int dep[300005];
int p[300005][31];
int diff[300005];
bool vis[300005];
int a[300005];
void dfs(int x){
	for(int i=head[x];i!=0;i=edge[i].nx){
		int v=edge[i].to;
		if(!vis[v]){
			dep[v]=dep[x]+1;
			p[v][0]=x;
			vis[v]=1;
			dfs(v);
		}
	}
}
int flca(int x,int y){
	if(dep[x]<dep[y]){
		swap(x,y);
	}
	for(int i=30;i>=0;i--){
		if(dep[p[x][i]]>=dep[y]){
			x=p[x][i];
		}
	}
	if(x==y) return x;
	for(int i=30;i>=0;i--){
		if(p[x][i]!=p[y][i]){
			x=p[x][i];
			y=p[y][i];
		}
	}
	return p[x][0];
}
void add_edge(int from,int to){
	edge[++num].nx=head[from];
	edge[num].to=to;
	head[from]=num;
}
void dfs_cnt(int x,int fa){
	for(int i=head[x];i!=0;i=edge[i].nx){
		int v=edge[i].to;
		if(v==fa)continue;
		dfs_cnt(v,x);
		diff[x]+=diff[v];
	}
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=n-1;i++){
		int x,y;
		cin>>x>>y;
		add_edge(x,y);
		add_edge(y,x);
	} 
	vis[1]=1;
	dfs(1);
	for(int i=1;(1<<i)<=n;i++){
		for(int j=1;j<=n;j++){
			p[j][i]=p[p[j][i-1]][i-1];
		}
	}
	for(int i=1;i<=n-1;i++){
		int to=a[i+1];
		int from=a[i];
		int mul=flca(from,to);
		diff[to]++;
		diff[from]++;
		diff[mul]--;
		diff[p[mul][0]]--;
	}
	dfs_cnt(1,0);
	for(int i=2;i<=n;i++){
		diff[a[i]]--;
	}
	for(int i=1;i<=n;i++){
		cout<<diff[i]<<endl;
	}
	return 0;
}