#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#include <functional>
#include <cassert>
using namespace std;
#define fast_io ios_base::sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0) ;
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define MOD (long long int)(1e9+7)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;

ll mpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
  else return mpow(a,b-1) * a % MOD;
}
ll lpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = lpow(a,b/2); return memo*memo;}
  else return lpow(a,b-1) * a;
}
ll gcd(ll a, ll b){
  if(b==0) return a;
  else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
  if(kaijo_memo.size() > n) return kaijo_memo[n];
  if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
  while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
  return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
  if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
  if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
  while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
  return gyaku_kaijo_memo[n];
}

ll nCr(ll n, ll r){
  if(n == r) return 1;//0個の丸と-1個の棒みたいな時に時に効く？不安.
  if(n < r || r < 0) return 0;
  ll ret = 1;
  if(n <= 1e7){
    ret *= kaijo(n); ret %= MOD;
    ret *= gyaku_kaijo(r); ret %= MOD;
    ret *= gyaku_kaijo(n-r); ret %= MOD;
  }else{
    rep(i,r){
      ret *= n-i; ret %= MOD;
      ret *= mpow(r-i, MOD-2); ret %= MOD;
    }
  }
  return ret;
}

vector<int> G[(int)2e5+3];
int C[(int)2e5+3];
ll ans[(int)2e5+3] = {};

void saiki(int now, int parent, map<int, ll>& mp){
  const int c = C[now];
  vector<map<int, ll>> rets;
  rep(j,G[now].size()){
    int next = G[now][j];
    if(next == parent) continue;
    rets.push_back(map<int, ll>());
    saiki(next, now, rets.back());
    ll minus = 0;
    if(rets.back().count(c) > 0){
      minus = rets.back()[c];
    }
    ans[c] += (rets.back()[-1] - minus) * (rets.back()[-1] - minus - 1) / 2 + (rets.back()[-1] - minus);
  }

  sort(all(rets), [](const map<int,ll>& a, const map<int,ll>& b){
    return a.size() > b.size();
  });

  if(rets.size() > 0){
    swap(mp, rets[0]);
  }

  rep(i,rets.size()){
    if(i==0) continue;
    for(auto itr : rets[i]){
      int key = itr.first;
      int val = itr.second;
      mp[key] += val;
    }
  }

  mp[-1] += 1;
  mp[c] = mp[-1];
}

int main(void){
  fast_io
  cout<<fixed<<setprecision(15);

  int n;cin>>n;
  rep(i,n){
    cin>>C[i];C[i]--;
  }
  rep(i,n-1){
    int a,b;cin>>a>>b;a--;b--;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  map<int, ll> mp;
  saiki(0, -1, mp);
  rep(key, n){
    ans[key] += (mp[-1] - mp[key]) * (mp[-1] - mp[key] - 1) / 2 + (mp[-1] - mp[key]);
  }

  rep(i,n){
    cout << n * (n-1) / 2 + n - ans[i] << endl;
  }
  return 0;
}