#include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#define bit(x) (1ll << (x))
using ll = long long;
//const ll MOD = (ll)1e9+7;
const ll MOD = 998244353;
const int INF = (ll)1e9+7;
const ll INFLL = (ll)1e18;
using namespace std;
template<class t>
using vvector = vector<vector<t>>;
template<class t>
using vvvector = vector<vector<vector<t>>>;
template<class t>
using priority_queuer = priority_queue<t, vector<t>, greater<t>>;
template<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}
template<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}
#ifdef DEBUG
#define debug(x) cout<<"LINE "<<__LINE__<<": "<<#x<<" = "<<x<<endl;
#else
#define debug(x) (void)0
#endif

namespace templates{
  ll modpow(ll x, ll b){
    ll res = 1;
    while(b){
      if(b&1)res = res * x % MOD;
      x = x * x % MOD;
      b>>=1;
    }
    return res;
  }

  ll modinv(ll x){
    return modpow(x, MOD-2);
  }

  bool was_output = false;
  template<class t>
  void output(t a){
    if(was_output)cout << " ";
    cout << a;
    was_output = true;
  }
  void outendl(){
    was_output = false;
    cout << endl;
  }
  ll in(){
    ll res;
    scanf("%lld", &res);
    return res;
  }

  template<class t>
  istream& operator>>(istream&is, vector<t>&x){
    for(auto &i:x)is >> i;
    return is;
  }

  template<class t, class u>
  istream& operator>>(istream&is, pair<t, u>&x){
    is >> x.first >> x.second;
    return is;
  }

  template<class t>
  void in(t&x){
    cin >> x;
  }

  template<class t>
  t in(){
    t res; cin >> res; return res;
  }

  template<class t>
  void out(t x){
    cout << x;
  }

  template<class t>
  vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){
    sort(line.begin(),line.end(),comp);
    return line;
  }

  template<class t>
  vector<t> reversed(vector<t> line){
    reverse(line.begin(),line.end());
    return line;
  }
}

using namespace templates;

ll n;
vector<int> color;
vvector<int> edges;
vector<ll> ans;

void setup(){
  n = in();
  color.resize(n);
  edges.resize(n);
  ans.resize(n,n*(n+1)/2);
  foreach(i,color)i=in()-1;
  rep(i,n-1){
    int a = in()-1;
    int b = in()-1;
    edges[a].emplace_back(b);
    edges[b].emplace_back(a);
  }
}

void func(){
  vector<int> nums(n,-1);
  vector<int> ends(n,-1);
  vector<int> parent(n,-1);
  vector<ll> sums(n,0);
  vector<ll> imagsums(n,n);
  {
    vector<int> color_parent(n,-1);
    function<void(int,int)> func=
      [&](int place,int last){
        static int cnt = 0;
        nums[place] = ++cnt;
        parent[place]=color_parent[color[place]];
        int bp = place;
        swap(color_parent[color[place]],bp);
        foreach(i,edges[place]){
          if(i==last)continue;
          ll dis = - cnt;
          func(i,place);
          dis += cnt;
          dis += sums[place];
          sums[place] = 0;
          ans[color[place]] -= dis * (dis+1) / 2;
        }
        swap(color_parent[color[place]],bp);
        ends[place] = cnt;
        if(parent[place]==-1){
          imagsums[color[place]] -= ends[place] - nums[place] + 1;
        }else{
          sums[parent[place]] -= ends[place] - nums[place] + 1;
        }
      };
    func(0,-1);
  }
  rep(i,n){
    ll dis = imagsums[i];
    ans[i] -= dis * (dis+1) / 2;
  }
}


int main(){
  setup();
  func();
  foreach(i,ans){
    cout<<i<<endl;
  }
  return 0;
}


Measured memory_bytes: 44696