#include<bits/stdc++.h>
using namespace std;
int rd() {int x=0,f=1;char c=getchar();while(!isdigit(c))f=(c=='-'?-1:f),c=getchar();while(isdigit(c))x=x*10+c-'0',c=getchar();return x*f;}
const int N=100005;
int n,fa[N],c[N],t[N],sum[N],ans[N],u[N],v[N];
vector<int> G[N];
map<int,int> cnt[N];
void dfs(int u,int f) {
    fa[u]=f;
    cnt[u][c[u]]++;
    for(int v:G[u]) if(v!=f) {
        dfs(v,u);
        // if(cnt[u].size()<cnt[v].size()) swap(cnt[u],cnt[v]);
        for(auto tmp:cnt[v]) {
            int x=tmp.first,c=tmp.second;
            cnt[u][x]+=c;
            if(cnt[u][x]==sum[x]) cnt[u].erase(cnt[u].find(x));
        }
        cnt[v].clear();
    }
    ans[u]=cnt[u].size();
}
signed main() {
    while(cin>>n) {
        memset(sum,0,sizeof(sum));
        for(int i=1;i<=n;i++) c[i]=t[i]=rd(),G[i].clear(),cnt[i].clear(),fa[i]=0;
        sort(t+1,t+1+n);
        int len=unique(t+1,t+1+n)-t-1;
        for(int i=1;i<=n;i++) c[i]=lower_bound(t+1,t+1+len,c[i])-t,sum[c[i]]++;
        for(int i=2;i<=n;i++) {
            int u=rd(),v=rd();
            printf("%d %d\n",u,v);
            G[u].push_back(v);
            G[v].push_back(u);
            ::u[i]=u,::v[i]=v;
        }
        dfs(1,0);
        for(int i=2;i<=n;i++) {
            if(fa[v[i]]==u[i]) swap(u[i],v[i]);
            printf("%d\n",ans[u[i]]);
        }
    }
    return 0;
}