#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
//increase stack size
#pragma comment(linker, "/STACK:16777216")

ll mxm() {return LLONG_MIN;}
template<typename... Args>
ll mxm(ll a, Args... args) { return max(a,mxm(args...)); }

ll mnm() {return LLONG_MAX;}
template<typename... Args>
ll mnm(ll a, Args... args) { return min(a,mnm(args...)); }

template<class T> ostream& operator<<(ostream& os,vector<T> V){
	os<<"[ ";for(auto v:V)os<<v<<" ";return os<<"]";
}
template<class L,class R> ostream& operator<<(ostream& os,pair<L,R> P){
	return os<<"("<<P.first<<","<<P.second<<")";
}

#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__,__VA_ARGS__)
template<typename Arg1>
void __f(const char* name,Arg1&& arg1){
	cout<<name<<" : "<<arg1<<endl;
}
template <typename Arg1,typename... Args>
void __f(const char* names,Arg1&& arg1,Args&&... args){
	const char* comma=strchr(names+1,',');cout.write(names,comma-names)<<" : "<<arg1<<" | ";__f(comma+1,args...);
}
#else
#define trace(...) 1
#endif

#define ld long double
#define pll pair<ll,ll>
#define ii pair<int,int>
#define vll vector<ll>
#define vii vector<ii>
#define vi vector<int>
#define vpll vector<pll>
#define vld vector<ld>
#define vvld vector<vld>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvpll vector<vpll>
#define vvii vector<vii>
#define I insert
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x)	x.begin(),x.end()

const int mod=1e9+7;
// 128 bit: __int128
inline int add(int a,int b){a+=b;if(a>=mod)a-=mod;return a;}
inline int sub(int a,int b){a-=b;if(a<0)a+=mod;return a;}
inline int mul(int a,int b){return (a*1ll*b)%mod;}
inline int power(int a,int b){int rt=1;while(b>0){if(b&1)rt=mul(rt,a);a=mul(a,a);b>>=1;}return rt;}
inline int inv(int a){return power(a,mod-2);}

struct compare{
	bool operator() (const int &a,const int &b) const{
		return a>b;
	}
};

const int N = 2e5 + 5;
ll n;
vll vis(N), lst(N, -1), subt(N), col(N), ans(N), tot(N), totlst(N);
vvi nodes(N), adj(N), chld(N);

void dfs0(int i){
	vis[i] = 1;
	subt[i] = 1;
	for(auto j : adj[i])
		if(!vis[j])
			dfs0(j), subt[i] += subt[j], chld[i].pb(j);
}

void dfs(int i){
	int sz = nodes[col[i]].size();
	ans[col[i]] += subt[i] * (n - subt[i] + 1);
	if(lst[col[i]] != -1)
		ans[col[i]] -= subt[i] * (n - subt[lst[col[i]]]);
	ans[col[i]] -= subt[i] * (tot[col[i]] - totlst[col[i]]);
	ll prev = totlst[col[i]];
	ll sum = 0;
	ll prev1 = lst[col[i]];
	for(auto j : chld[i]){
		ans[col[i]] += sum * subt[j];
		sum += subt[j];
		lst[col[i]] = j;
		totlst[col[i]] = tot[col[i]];
		dfs(j);
		while(nodes[col[i]].size() > sz)
			tot[col[i]] -= subt[nodes[col[i]].back()], nodes[col[i]].pop_back();
	}
	nodes[col[i]].push_back(i);
	tot[col[i]] += subt[i];
	totlst[col[i]] = prev;
	lst[col[i]] = prev1;
}

int main()
{
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cout<<setprecision(25);
	cin >> n;
	for(ll i = 0; i < n; i++)
		cin >> col[i];
	for(ll i = 0; i < n - 1; i++){
		ll u, v;
		cin >> u >> v;
		--u, --v;
		adj[u].pb(v);adj[v].pb(u);
	}
	dfs0(0);
	dfs(0);
	for(int i = 1; i <= n; i++)
		cout << ans[i] << endl;
}

Measured memory_bytes: 63392