#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE
class TreeSize{
public:
  Int V;                        //ノード数
  Int root;                     //根
  vector<vector<Int> > G;       //Graph
  vector<Int> w;                //ノードのに重みが有る場合デフォルトでは1
  vector<Int> sz;               //部分木のサイズ
  Int ok;
  TreeSize():V(-1){};
  TreeSize(Int V,Int root = 0):V(V),root(root),G(V),w(V,1),sz(V,0),ok(0){}
  TreeSize(vector<vector<Int> > G,Int root = 0):V(G.size()),root(root),G(G),w(V,1),sz(V,0),ok(0){}
  void resize(Int n){*this = TreeSize(n);}
  Int& operator [](Int i){return w[i];}

  void add_edge(Int a,Int b){
    ok = false;
    assert(a < V && b < V);
    assert(a >= 0 && b >= 0);
    G[a].push_back(b);
    G[b].push_back(a);
  }

  void build(Int root=-1){
    ok = 1;
    if(root != -1) this->root = root;
    dfs(this->root,-1);
  }

  Int dfs(Int pos,Int pre = -1){
    sz[pos] = w[pos];
    for(Int to:G[pos]) if(to != pre) sz[pos] += dfs(to, pos);
    return sz[pos];
  }
  Int size(Int i){assert(ok);return sz[i];}
};

Int N;
vector<Int> C;
vector<vector<Int> > G;
vector<vector<Int> > V;
TreeSize TS;
void dfs(Int pos, Int pre, vector<Int> &cpar){
  Int col = C[pos];
  if(pos != N) V[ cpar[col] ].push_back(pos);
  for(Int to:G[pos]){
    if(to == pre) continue;
    Int tmp = cpar[ col ];
    cpar[ col ] = to;
    dfs(to, pos, cpar);
    cpar[ col ] = tmp;
  }
}

vector<Int> ans;
void dfs2(Int pos, Int pre){
  if(pos == N){
    vector<Int> num(N, TS.size(0));
    for(Int v:V[N]) num[ C[v] ] -= TS.size(v);
    for(Int i=0;i<N;i++) ans[i] += num[i] * (num[i] - 1) / 2 + num[i];
    dfs2(0, N);
  }
  else{
    Int cnt = 0;
    for(Int to:G[pos]){
      if(to == pre) continue;
      dfs2(to, pos);
      Int num = TS.size(to);
      for(Int v:V[to]) num -= TS.size(v);
      cnt += num * (num - 1) / 2 + num;
    }
    ans[ C[pos] ] += cnt;
  }

}



signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  cin>>N;
  C.resize(N);
  cin>>C;
  for(Int &c:C) c--;
  C.push_back(N);
  G.resize(N + 1);
  TS.resize(N + 1);
  for(Int i=0;i<N-1;i++){
    Int a, b;
    cin>>a>>b; a--, b--;
    G[a].push_back(b);
    G[b].push_back(a);
    TS.add_edge(a, b);
  }

  G[0].push_back(N);
  G[N].push_back(0);
  TS.add_edge(0, N);
  TS.build(N);
  vector<Int> cpar(N + 1, N);
  V.resize(N + 1);
  dfs(N, -1, cpar);


  ans.resize(N, 0);
  dfs2(N, -1);
  for(Int a:ans) cout<<N * (N - 1) / 2 + N - a <<endl;

  return 0;
}


Measured memory_bytes: 61096