#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define eps 1e-8
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
#define N 300005
vector<int>T[N],v[N];
ll sum[N+N];
int s[N],vis[N],n;
int fa[N+N],ls[N+N],rs[N+N];
int find(int x){
	if(x==fa[x])return x;
	return fa[x]=find(fa[x]);
}
void dfs(int x){
	if(x<=n)return;
	sum[ls[x]]+=sum[x];
	sum[rs[x]]+=sum[x];
	dfs(ls[x]);
	dfs(rs[x]);
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&s[i]);
	for(int i=1;i<n;i++){
		int u,v;
		scanf("%d%d",&u,&v);
		T[u].push_back(v);
		T[v].push_back(u);
	}
	for(int i=1;i<=n;i++)v[s[i]].push_back(i);
	int tot=n;
	for(int i=1;i<=n+n;i++)fa[i]=i;
	for(int i=1;i<=n;i++){
		for(int x:v[i])sum[find(x)]+=x;
		// for(int x:v[i])printf("find(%d)=%d\n",x,find(x));
		for(int x:v[i])for(int u:T[x])if(vis[u])sum[find(u)]+=x;
		for(int x:v[i]){
			vis[x]=1;
			for(int u:T[x]){
				if(vis[u]){
					int f1=find(x);
					int f2=find(u);
					fa[f1]=fa[f2]=++tot;
					ls[tot]=f1,rs[tot]=f2;
				}
			}
		}
	}
	dfs(tot);
	for(int i=1;i<=n;i++)printf("%lld ",sum[i]);
	return 0;
}
// quod erat demonstrandum