#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
typedef long long LL;
int N;
LL A[200001];
vector<int>G[200001];
LL cnt[200001];
LL ans[200001];


LL calc(LL x){
	LL ans=x*(x-1)/2;
	ans+=x;
	return max((LL)0,ans);
}

int dfs2(int x,int p){
	int size=1;
	LL t=0;
	REP(i,G[x].size()){
		if(G[x][i]!=p){
			LL now=cnt[A[x]];//開始時の数
			int s=dfs2(G[x][i],x);
			LL now2=cnt[A[x]];//終了時の値
			LL res=s-(now2-now);
			ans[A[x]]+=max(LL(0),calc(res));
			t+=res;
			size+=s;
		}
	}
	cnt[A[x]]+=(t+1);
	return size;
}

int main(){
	cin>>N;
	REP(i,N){
		cin>>A[i];
		A[i]--;
	}
	REP(i,N-1){
		int a,b;
		cin>>a>>b;
		a--;b--;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	REP(i,N){
		cnt[i]=0;
		ans[i]=0;
	}
	dfs2(0,-1);
	REP(i,N){
		//cout<<"i"<<i<<" "<<ans[i]<<endl;
		cout<<calc(N)-ans[i]-calc(N-cnt[i])<<endl;
	}
	return 0;
}