#pragma GCC optimize (2)

#include<cstdio>

#include<iostream>

#define R register int

const int M=;

using namespace std;

inline int g() {

    R ret=; register char ch; while(!isdigit(ch=getchar()));

    do ret=ret*+(ch^); while(isdigit(ch=getchar())); return ret;

}

int n,cnt;

int vr[M<<],nxt[M<<],fir[M],a[M],d[M],f[M][],w[M],ans[M];

inline void add(int u,int v) {vr[++cnt]=v,nxt[cnt]=fir[u],fir[u]=cnt;}

void dfs(int u) {

    for(R i=fir[u];i;i=nxt[i]) { R v=vr[i];

        if(d[v]) continue; d[v]=d[u]+; R p=u; f[v][]=u;

        for(R j=;f[p][j];++j) f[v][j+]=f[p][j],p=f[p][j];

        dfs(v);

    }

}

inline void lca(int u,int v) {

    if(d[u]<d[v]) swap(u,v); R uu=u,vv=v;

    for(R j=;j>=;--j) if(d[f[u][j]]>=d[v]) u=f[u][j];

    if(u==v) {--w[u],--w[f[u][]],++w[uu],++w[vv]; return ;}

    for(R j=;j>=;--j) if(f[u][j]!=f[v][j]) u=f[u][j],v=f[v][j];

    u=f[u][]; ++w[uu],++w[vv],--w[u],--w[f[u][]]; return ;

}

void dfs2(int u) {

    for(R i=fir[u];i;i=nxt[i]) { R v=vr[i];

        if(v==f[u][]) continue; dfs2(v);

        w[u]+=w[v];

    }

}

signed main() {

    n=g(); for(R i=;i<=n;++i) a[i]=g();

    for(R i=,u,v;i<n;++i) u=g(),v=g(),add(u,v),add(v,u);

    d[]=; dfs(); for(R i=;i<n;++i) lca(a[i],a[i+]); dfs2();

    for(R i=;i<=n;++i) printf("%d\n",(i==a[]?w[i]:w[i]-));

}