#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
#define sz(v) ((int) v.size())

using namespace std;

using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << endl; exit(0); }
inline void no() { cout << "No" << endl; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); return a / gcd(a, b) * b; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { x = max(x, y); }
template <typename T> inline void amin(T &x, T y) { x = min(x, y); }
template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }

template <typename T>
struct FenwickTree {
  vector<T> v;
  int n;
  FenwickTree(int n) : n(n) {
    v = vector<T>(n);
  }
  void update(int i, T x) {
    for (i++; i <= n; i += i & -i) v[i - 1] += x;
  }
  T query(int i) {
    T r = 0;
    for (; i >= 1; i -= i & -i) r += v[i - 1];
    return r;
  }
};

void solve() {
  int n;
  cin >> n;
  vi32 c(n);
  cin >> c;
  rep(i, n) c[i]--;
  vector<vi32> g(n);
  rep(i, n - 1) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  vector<vi32> cs(n);
  rep(i, n) {
    cs[c[i]].push_back(i);
  }
  vi32 in(n), out(n);
  {
    int k = 0;
    auto dfs = [&](auto dfs, int u, int p) -> void {
      in[u] = k++;
      for (auto v : g[u]) if (v != p) {
        dfs(dfs, v, u);
      }
      out[u] = k;
    };
    dfs(dfs, 0, -1);
  }
  auto f = [&](int c) {
    return (i64) c * (c + 1) / 2;
  };
  FenwickTree<int> ft(n);
  rep(i, n) ft.update(i, 1);
  rep(i, n) {
    auto& target = cs[i];
    sort(all(target), [&](int i, int j) {
      return in[i] > in[j];
    });
    i64 sum = f(n);
    using P = pair<int, int>;
    vector<P> history;
    for (auto u : target) {
      int acc = 1;
      for (auto v : g[u]) {
        if (in[u] > in[v]) continue;
        int c = ft.query(out[v]) - ft.query(in[v]);
        acc += c;
        sum -= f(c);
      }
      ft.update(in[u], -acc);
      history.emplace_back(u, acc);
    }
    sum -= f(ft.query(n));
    cout << sum << '\n';
    for (auto p : history) {
      int u, acc;
      tie(u, acc) = p;
      ft.update(in[u], acc);
    }
  }
}


Measured memory_bytes: 44652