#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int>p[300005];
vector<int>ss[300005];
int sz[300005],fa[300005],s[300005],tag[300005],ans[300005],ok[300005];int n;
vector<int>l[300005];
int find(int x){
	if(fa[x] == x)return x;
	return fa[x] = find(fa[x]);
}void merge(int x,int y){
	if(sz[x]>sz[y])swap(x,y);
	tag[x]-=tag[y];
	for(int a:ss[x]){
		ans[a]+=tag[x];
		ss[y].push_back(a);
	}sz[y]+=sz[x];fa[x] = y;
}
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n;for(int i = 1;i<=n;i++)cin >> s[i];
	for(int i = 1;i<=n;i++)tag[i] = i,fa[i] = i,sz[i] = 1,ss[i].push_back(i); 
	for(int i = 1;i<n;i++){
		int a,b;cin >> a >> b;p[a].push_back(b),p[b].push_back(a);
	}for(int i = 1;i<=n;i++)l[s[i]].push_back(i);
	for(int i = 1;i<=n;i++){
		for(int x:l[i]){
			for(int xx:p[x]){
				if(ok[xx])tag[find(xx)]+=x;
			}
		}for(int x:l[i]){
			ok[x] = 1;
			for(int xx:p[x]){
				if(ok[xx]){
					merge(find(xx),find(x));
				}
			}
		}
	}for(int i = 1;i<=n;i++)ans[i]+=tag[find(i)];
	for(int i = 1;i<=n;i++)cout << ans[i] << " ";cout << endl;
	return 0;
}/*
启发式合并不管咋做都对。
si有相同要注意点细节。 
*/