#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

const int N = 2e5 + 10;
vector<int> a[N], A[N];
int c[N];
int64 sz[N], cnt[N];
int tin[N], tout[N];

int stamp;
void DFS(int u, int parent) {
  sz[u] = 1;
  tin[u] = stamp++;
  for (auto& v : a[u]) {
    if (v == parent) continue;
    DFS(v, u);
    sz[u] += sz[v];
  }
  tout[u] = stamp;
  A[c[u]].push_back(u);
}

int64 count(int64 n) {
  return n * (n + 1) / 2;
}

template<typename T, size_t N>
struct fenwick {
  T c[N + 1];
  void add(int x, T y) {
    for (; x <= N; x += x & -x) {
      c[x] += y;
    }
  }
  T query(int x) {
    T ret = 0;
    for (; x; x -= x & -x) {
      ret += c[x];
    }
    return ret;
  }
};

fenwick<int, N> B;

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &c[i]);
    --c[i];
  }
  for (int i = 1; i < n; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    --x; --y;
    a[x].push_back(y);
    a[y].push_back(x);
  }
  stamp = 0;
  DFS(0, -1);
  for (int i = 0; i < n; ++i) {
    auto& vec = A[i];
    if (vec.empty()) {
      puts("0");
      continue;
    }
    int64 ret = count(n);
    // trace(i, ret);
    for (auto& u : vec) {
      cnt[u] = 0;
      for (auto& v : a[u]) {
        if (tin[v] < tin[u]) continue;
        int64 cur = sz[v] - (B.query(tout[v]) - B.query(tin[v]));
        ret -= count(cur);
        cnt[u] += cur;
      }
      B.add(tin[u] + 1, cnt[u] + 1);
    }
    int u = vec.back();
    int64 t = n - B.query(n);
    ret -= count(t);
    for (auto& u : vec) {
      B.add(tin[u] + 1, -cnt[u] - 1);
    }
    printf("%lld\n", ret);
  }
  return 0;
}


Measured memory_bytes: 42012