// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define whole(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define bit(n) (1LL<<(n))
#define F first
#define S second
// functions
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), 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;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << "(" << p.first << ", " << p.second << ")"; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20);}
} fast_io_;

int c[200010], h[200010];
vector<int> edge[200010], child[200010];
int siz[200010];

void dfs(int i, int p){
  siz[i] = 1;
  for(auto e: edge[i]){
    if(e == p)continue;
    h[e] = h[i] + 1;
    child[i].pb(e);
    dfs(e, i);
    siz[i] += siz[e];
  }
}

map<int, ll> v[200010];
ll ans[200010];

void calc(int i){
  if(sz(child[i]) == 0){
    v[i][c[i]] = 1;
    return;
  }
  for(auto e: child[i]){
    calc(e);
    ll tmp = siz[e] - v[e][c[i]];
    ans[c[i]] += tmp * (tmp + 1) / 2;
    if(sz(v[i]) < sz(v[e])){
      swap(v[i], v[e]);
    }
    irep(itr, v[e]){
      v[i][itr->first] += itr->second;
    }
    v[e].clear();
  }
  v[i][c[i]] = siz[i];
}

int main(int argc, char const* argv[])
{
  int n; cin >> n;
  rep(i, n)cin >> c[i];
  vector<bool> ex(n + 1, false);
  rep(i, n)ex[c[i]] = true;
  rep(i, n - 1){
    int a, b; cin >> a >> b, a--, b--;
    edge[a].pb(b);
    edge[b].pb(a);
  }
  dfs(0, -1);
  calc(0);
  FOR(i, 1, n + 1){
    if(i != c[0]){
      ll tmp = n - v[0][i];
      ans[i] += tmp * (tmp + 1) / 2;
    }
  }
  FOR(i, 1, n + 1){
    if(!ex[i]){
      cout << 0 << endl;
      continue;
    }
    ll res = (ll)n * (ll)(n + 1) / 2;
    res -= ans[i];
    cout << res << endl;
  }
  return 0;
}
