#include <bits/stdc++.h>                                           
 
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;



typedef pair < long long, long long > pll;
typedef unsigned long long ull;
typedef pair < int, int > pii;
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;
typedef long long ll;
typedef double db;
 
 
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 2e5 + 11;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 466;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;



int n, v, u, a[N], cnt[N], res[N], d[N], par[N];
stack < int > st[N];
vi g[N], gg[N];

int get (int x) {
	return x * (x + 1) / 2;
}

void dfs1 (int v, int p = 0) {
	cnt[v] = 1;
	par[v] = p;
	for (auto to : g[v])
		if (to != p) {
			d[to] = d[v] + 1;
			dfs1(to, v);
			cnt[v] += cnt[to];
		}
}
	

void dfs (int v, int p = 0) {	
	st[a[p]].push(v);
	if (!sz(st[a[v]])) 
		gg[a[v] + n].pb(v);
	else {
		int u = st[a[v]].top();
		gg[u].pb(v);
	}

	for (auto to : g[v]) 
		if (to != p) 
			dfs(to, v);	
		

	st[a[p]].pop();
}

main () {
	scanf("%lld", &n);
	for (int i = 1; i <= n; ++i) {
		scanf("%lld", &a[i]); 
		res[i] = get(n);
	}
	
	for (int i = 1; i < n; ++i) {
		scanf("%lld%lld", &v, &u);
		g[v].pb(u);
		g[u].pb(v);
	}

	dfs1(1);
	return 0;
	dfs(1);	
	
	for (int i = 1; i <= n + n; ++i)
		if (i <= n) {
			int c = cnt[i];
			for (auto j : gg[i])
				c -= cnt[j];
			res[a[par[i]]] -= get(c);
//			cerr << par[i] << ' ' << c << endl;
		} else {
			int c = n;
			for (auto j : gg[i])
				c -= cnt[j];
			res[i - n] -= get(c);
//			cerr << i - n << ' ' << c << endl;
		}

	for (int i = 1; i <= n; ++i)
		printf("%lld\n", res[i]);
}

