#include<bits/stdc++.h>
using namespace std;
#define pfi(a) printf("%d",a);
#define pfl(a) printf("%lld",a);
#define pfin(a) printf("%d\n",a);
#define pfln(a) printf("%lld\n",a);
#define sfi(a) scanf("%d",&a);
#define sfl(a) scanf("%lld",&a);
#define pb push_back
#define f(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define endl "\n"
const int MAXN=3e5+5;
const int M= 1e9+7;

int col[MAXN];

ll res[MAXN],sub[MAXN],val[MAXN];

vector<int> v[MAXN];

void dfs(int node,int par){
	sub[node]=1;

	for(int x:v[node]){
		if(x==par) continue;

		dfs(x,node);
		sub[node]+=sub[x];
	}
}

void solve(int node,int par){
	ll N=val[col[node]];

	ll fin=(N-sub[node]+1)*(sub[node]);

	ll sum=0;

	for(int x:v[node]){
		if(x==par) continue;
		fin+=(sum*sub[x]);
		sum+=sub[x];
	}

	res[col[node]]+=fin;

	for(int x:v[node]){
		if(x==par) continue;
		val[col[node]]=sub[x];
		solve(x,node);
	}

	val[col[node]]=N-sub[node];

}

int main(){	
	
	int n;
	sfi(n)

	f(i,1,n+1){
		sfi(col[i])
		val[i]=n;
	}

	f(i,0,n-1){
		int x,y;
		sfi(x) sfi(y)

		v[x].push_back(y);
		v[y].push_back(x);
	}

	dfs(1,1);

	solve(1,1);

	for(int i=1;i<=n;i++){
		cout<<res[i]<<"\n";
	}


	return 0;	
}