#include<bits/stdc++.h>
using namespace std;
 
#define pb push_back
#define ll long long
#define fr(i,j,k) for(int i=j;i<k;i++)
#define f(n) fr(i,0,n)
#define f1(n) fr(i,1,n+1)
#define ms(i) memset(i,0,sizeof(i));
#define ms1(i) memset(i,-1,sizeof(i));
#define pll pair<ll,ll>
#define pii pair<int,int>
#define F first
#define S second
const int maxn = 2e5 + 5;
const int mod = 998244353;
ll ans[200005];
int c[200005];
ll cnt[200005];
ll cur[200005];
ll sz[200005];
vector<int>g[200005];
void dfs(int now, int pre) {
    sz[now] = 1;
    int in = cur[c[now]];
    for (auto i : g[now]) {
        if (i == pre) continue;
        int be = cur[c[now]];
        dfs(i, now);
        int af = cur[c[now]];
        int mt = sz[i] - (af-be);
        ans[c[now]] -= cnt[mt];
        sz[now] += sz[i];
    }
    cur[c[now]] = in + sz[now];
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n;
    cin >> n;
    f1 (n) {
        ans[i] = n * (n + 1) / 2;
        cnt[i] = (ll)i * (i + 1) / 2;
        cin >> c[i];
    }
    f (n - 1) {
        int x, y;
        cin >> x >> y;
        g[x].pb(y);
        g[y].pb(x);
    }
    dfs(1, 0);
    f1 (n) {
        ans[i] -= cnt[n - cur[i]];
        cout << ans[i] << '\n';
    }
}
