#include <bits/stdc++.h>
 
using namespace std;
 
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef long long ll;
#define int ll
 
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(int)(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl;
//int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
const ll MOD = 1000000007;
//const ll MOD = 998244353;
// #define mp make_pair
//#define endl '\n'

const int N = 211111;
//const int N = 3;
vii G(N);
vi c(N);
vi ans(N);
vi root_num(N);
vi num(N);
vi sub(N);
vi parent(N);
int n;

void pre_dfs(int now, int par) {
    sub[now] = 1;
    parent[now] = par;
    for (int ch: G[now]) {
        if (ch == par) continue;
        pre_dfs(ch, now);
        sub[now] += sub[ch];
    }
}

void dfs(int now, int par, vi& latest) {
    ll ori;
    if (now == 0) {
        rep (i, n) latest[i] = 0;
        ori = 0;
    }
    else {
        ori = latest[c[par]];
        latest[c[par]] = now;
    }
    int last_same = latest[c[now]];
    if (last_same != 0) {
        num[last_same] -= sub[now];
    }
    else {
        root_num[c[now]] -= sub[now];
    }

    for (int ch: G[now]) {
        if (ch == par) continue;
        dfs(ch, now, latest);
    }
    
    if (now == 0) {
    }
    else {
        latest[c[par]] = ori;
    }
}

signed main() {
    fio();
    cin >> n;
    rep (i, n) {
        cin >> c[i];
        c[i]--;
    }
    rep (i, n - 1) {
        int u, v;
        cin >> u >> v;
        u--; v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }

    pre_dfs(0, -1);
    rep (i, n) {
        num[i] = sub[i];
    }
    rep (i, n) {
        root_num[i] = num[0];
    }

    vi latest(n);
    dfs(0, -1, latest);
    // DEBUG_VEC(num);
    // DEBUG_VEC(root_num);

    vl ans(n);
    rep (i, n) {
        ans[i] = n * (n - 1) / 2 + n;
    }
    for (int i = 1; i < n; i++) {
        int pc = c[parent[i]];
        ans[pc] -= num[i] * (num[i] - 1) / 2 + num[i];
    }
    rep (i, n) {
        ans[i] -= root_num[i] * (root_num[i] - 1) / 2 + root_num[i];
    }

    rep (i, n) {
        cout << ans[i] << endl;
    }
}

Measured memory_bytes: 39840