#include<iostream>

#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;

typedef long long ll;

int const xn=1e5+;

int n,c[xn],hd[xn],ct,to[xn<<],nxt[xn<<],cnt[xn],siz[xn],son[xn],mx,big;

ll ans[xn],sum;

void add(int x,int y){to[++ct]=y; nxt[ct]=hd[x]; hd[x]=ct;}

int rd()

{

    int ret=,f=; char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=; ch=getchar();}

    while(ch>=''&&ch<='')ret=(ret<<)+(ret<<)+ch-'',ch=getchar();

    return f?ret:-ret;

}

void dfs(int x,int fa)

{

    siz[x]=;

    for(int i=hd[x],u;i;i=nxt[i])

    {

        if((u=to[i])==fa)continue;

        dfs(u,x); siz[x]+=siz[u];

        if(siz[u]>siz[son[x]])son[x]=u;

    }

}

void add(int x,int fa,int v)

{

    cnt[c[x]]+=v;

    if(cnt[c[x]]>mx)sum=c[x],mx=cnt[c[x]];

    else if(cnt[c[x]]==mx)sum+=c[x];

    for(int i=hd[x],u;i;i=nxt[i])

        if((u=to[i])!=fa&&u!=big)add(u,x,v);

}

void dfs2(int x,int fa,int keep)

{

    for(int i=hd[x],u;i;i=nxt[i])

        if((u=to[i])!=fa&&u!=son[x])dfs2(u,x,);

    if(son[x])dfs2(son[x],x,),big=son[x];

    add(x,fa,); big=;

    ans[x]=sum;

    if(!keep)add(x,fa,-),mx=sum=;//=0!

}

int main()

{

    n=rd();

    for(int i=;i<=n;i++)c[i]=rd();

    for(int i=,x,y;i<n;i++)

    {

        x=rd(); y=rd();

        add(x,y); add(y,x);

    }

    dfs(,); dfs2(,,);

    for(int i=;i<=n;i++)printf("%I64d ",ans[i]);

    return ;

}