代码:

#include<bits/stdc++.h>
using namespace std;
const int N=3e5+9;
int n,a[N],id[N],top[N],son[N],fa[N],siz[N],dep[N],cnt;
struct node{
	int l,r;
	int add,sum;
}tr[N<<2];

vector<int>edge[N];
inline int read()
{
    int s=0,f=1;
    char ch=getchar();
    while (!isdigit(ch))
    {
        ch=='-'?f=-1:f=1;
        ch=getchar();
    }
    while (isdigit(ch))
    {
        s=(s<<3)+(s<<1)+(ch^48);
        ch=getchar();
    }
    return s*f;
}
inline void write(int x)
{
    (x<0)?(putchar('-'),x=-x):-1;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
void dfs1(int u,int f,int deep)
{
	fa[u]=f;
	siz[u]=1;
	dep[u]=deep;
	int maxson=-1;
	for(register int i=0;i<edge[u].size();i++)
	{
		int v=edge[u][i];
		if(v==f)continue;
		dfs1(v,u,deep+1);
		siz[u]+=siz[v];
		if(siz[v]>maxson)
		{
			maxson=siz[v];
			son[u]=v;
		}
	}
}
void dfs2(int u,int topf)
{
	top[u]=topf;
	id[u]=++cnt;
	if(!son[u])return;
	dfs2(son[u],topf);
	for(register int i=0;i<edge[u].size();i++)
	{
		int v=edge[u][i];
		if(v==fa[u]||v==son[u])continue;
		dfs2(v,v);
	}
}
inline void push_up(int u)
{
	tr[u].sum=tr[u<<1].sum+tr[u<<1|1].sum;
}
inline void push_down(int u)
{
	tr[u<<1].add+=tr[u].add;
	tr[u<<1|1].add+=tr[u].add;
	tr[u<<1].sum+=(tr[u<<1].r-tr[u<<1].l+1)*tr[u].add;
	tr[u<<1|1].sum+=(tr[u<<1|1].r-tr[u<<1|1].l+1)*tr[u].add;
	tr[u].add=0;
}
void build(int u,int l,int r)
{
	tr[u].l=l;
	tr[u].r=r;
	tr[u].add=0;
	if(l==r)
	{
		tr[u].sum=0;
		return;
	}
	int mid=l+r>>1;
	build(u<<1,l,mid);
	build(u<<1|1,mid+1,r);
	push_up(u);
}
void modify(int u,int l,int r,int v)
{
	if(tr[u].l>=l&&tr[u].r<=r)
	{
		tr[u].add+=v;
		tr[u].sum+=(tr[u].r-tr[u].l+1)*v;
	}
	else
	{
		push_down(u);
		int mid=tr[u].l+tr[u].r>>1;
		if(l<=mid)modify(u<<1,l,r,v);
		if(r>mid)modify(u<<1|1,l,r,v);
		push_up(u); 
	}
}
int query(int u,int l,int r)
{
	if(tr[u].l>=l&&tr[u].r<=r)return tr[u].sum;
	else
	{
		push_down(u);
		int ans=0;
		int mid=tr[u].l+tr[u].r>>1;
		if(l<=mid)ans+=query(u<<1,l,r);
		if(r>mid)ans+=query(u<<1|1,l,r);
		return ans;
	}
}
inline int R_change(int x,int y,int z)
{
	while(top[x]!=top[y])
	{
		if(dep[top[x]]<dep[top[y]])swap(x,y);
		modify(1,id[top[x]],id[x],z);
		x=fa[top[x]];
	}
	if(dep[x]>dep[y])swap(x,y);
	modify(1,id[x],id[y],z);
}
int main(void)
{
	n=read();
	for(register int i=1;i<=n;i++)
		a[i]=read();
	for(register int i=1;i<=n-1;i++)
	{
		int x,y;
		x=read();
		y=read();
		edge[x].push_back(y);
		edge[y].push_back(x);
	}
	dfs1(1,0,1);
	dfs2(1,1);
	build(1,1,n);
	for(register int i=2;i<=n;i++)
	{
		int l=a[i-1];
		int r=a[i];
		R_change(l,r,1);
		modify(1,id[r],id[r],-1);
	}
	for(register int i=1;i<=n;i++)
		write(query(1,id[i],id[i])),puts("");
	return 0;
}