#include<bits/stdc++.h>
#define LL long long
#define P pair<int,int>
#define fi first
#define se second
#define fr(x) freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);
using namespace std;
const int N=1e5+5;
int n,a[N],s[N],ans[N],c[N];
vector<P>g[N];
map<int,int>mp[N];
void dfs(int x,int fa,int w)
{
	mp[x][a[x]]=1;c[x]=(s[a[x]]>1);
	for(auto [y,t]:g[x]) if(y^fa)
	{
		dfs(y,x,t);
		if(mp[x].size()<mp[y].size()) swap(mp[x],mp[y]),swap(c[x],c[y]);
		for(auto [X,Y]:mp[y])
		{
			if(!mp[x].count(X)) c[x]++;
			mp[x][X]+=Y;
			if(mp[x][X]==s[X]) c[x]--;
		} 
	}ans[w]=c[x];
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	while(cin>>n)
	{
		for(int i=1;i<=n;i++) cin>>a[i],s[a[i]]++;
		for(int i=1,u,v;i<n;i++) cin>>u>>v,g[u].push_back({v,i}),g[v].push_back({u,i});
		dfs(1,0,0);
		for(int i=1;i<n;i++) cout<<ans[i]<<"\n";	
		for(int i=1;i<=n;i++) g[i].clear(),s[i]=0,mp[i].clear();
	}
	return 0;
}