#include <bits/stdc++.h>
using namespace std;

#define max_N 200010

int color[max_N];
vector<int> edges[max_N];
vector<int> sub_child[max_N];
long sub_size[max_N];
int parent[max_N];
int last_v[max_N];
long no_samecolor_vertex[max_N];
long ans[max_N];

long non_dupcount(int x){
	return (long) x * (x-1) / 2 + x;
}

void dfs(int v, int last = -1){
	parent[v] = last_v[color[v]];
	last_v[color[v]] = v;
	sub_size[v] = 1;
	if(parent[v] != -1) sub_child[parent[v]].push_back(v);
	for(auto x: edges[v]) {
		if(x == last) continue;
		dfs(x, v);
		long t_size = sub_size[x];
		sub_size[v] += t_size;
		for(auto child: sub_child[v])
			t_size -= sub_size[child];
		sub_child[v].clear();
		ans[color[v]] -= non_dupcount(t_size);
	}
	if(parent[v] == -1)
		no_samecolor_vertex[color[v]] -= sub_size[v];
	last_v[color[v]] = parent[v];
}

int main(){
	int n;
	scanf("%d", &n);
	for(int i = 0; i < n; i++) {
		scanf("%d", &color[i]);
		color[i]--;
	}
	for(int i = 0; i < n-1; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		edges[x-1].push_back(y-1);
		edges[y-1].push_back(x-1);
	}
	for(int i = 0; i < n; i++) {
		no_samecolor_vertex[i] = n;
		last_v[i] = -1;
		ans[i] = non_dupcount(n);
	}
	dfs(0);
	for(int i = 0; i < n; i++) {
		ans[i] -= non_dupcount(no_samecolor_vertex[i]);
		printf("%ld\n", ans[i]);
	}
}
