//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")

//# include <x86intrin.h>
# include <bits/stdc++.h>

# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
int a[N];
vector < int > g[N], c[N];
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int lst[N];
int was[N];
int prev[N];
int sz[N];
ll sum[N];
int tin[N];
int tout[N];
int timer;
int up[20][N];
#define prev mal
int prev[N];

bool upper (int x, int y) {
	if (x > n || x == 0) return 1;
	return tin[x] <= tin[y] && tout[x] >= tout[y];
}

int lca (int a, int b) {
	if (upper(a, b)) return 1;
	for (int i = 17; i >= 0; --i) {
		if (!upper(up[i][a], b)) {
			a = up[i][a];
		}
	}

	return a;
}


void dfs (int v, int pr = 0) {
	tin[v] = ++timer;
	sz[v] = 1;
	up[0][v] = pr;
	int chan = lst[a[v]];

	prev[v] = chan;
	lst[a[v]] = v;
	
	for (int i = 1; i < 18; ++i) {
		up[i][v] = up[i-1][up[i-1][v]];
	}
	for (auto to : g[v]) if (to != pr) {
		dfs(to, v);
		sz[v] += sz[to];
	}
	tout[v] = timer;
    lst[a[v]] = chan;
}

int main () {
	SpeedForce;
	
	cin >> n;
	For (i, 1, n) {
		cin >> a[i];
		c[a[i]].pb(i);
	}
	For (i, 2, n) {
		int l, r;
		cin >> l >> r;
		g[l].pb(r);
		g[r].pb(l);
	}

	dfs(1);

   	For (i, 1, n) {
    	sort(every(c[i]), [&](int x, int y) { return tin[x] < tin[y]; });
    	auto f = [&](ll n) {
    		return n * (ll)(n+1)/ 2ll;
    	};

    	ll ans = f(n);
    	int cnt = n;
    	map < int, int > val;
    	map < int, int > was;
    	for (int j = sz(c[i]) - 1; j >= 0; --j) {
    		int v = c[i][j];
    		was[prev[v]] = 1;
    		if (!prev[v]) cnt -= sz[v];
    		else {
    			//cout << v << ' ' << prev[v] << ' ' << oth << '\n';

    			int oth = lca(v, prev[v]);
    //			if(i==2)
    //				cout << v << ' ' << prev[v] << ' ' << oth << '\n';


    			val[oth] -= sz[v];
    		}
    	}
    //	if(i == 2) exit(0);
    	for (auto v : c[i]) {
    		{
    			for (auto to : g[v]) if (upper(v, to) && !val.count(to)) {
    				//coit << to << '\n';
    				ans -= f(sz[to]);
    			}
    		}
    	}
    //	cout << "col : " << i << '\n';
    	for (auto it : val) {
    //		cout << it.second << ' ' << sz[it.first] << '\n';
    		ans -= f(it.second + sz[it.first]);
    	}

    	ans -= f(cnt);

    	cout << ans << '\n';
 	}

	return Accepted;
}

// B...a

Measured memory_bytes: 78288