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

#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) begin(x), end(x)
#define uniq(x) (x).erase(unique(all(x)), end(x))
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a) - 1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr long double PI = 3.1415926535897932384626433832795028L;
constexpr int DY[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int DX[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
    while (b) { swap(a %= b, b); }
    return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template<typename T> void fin(T mes) {
    cout << mes << endl;
    exit(0);
}
template<typename T, typename U> bool chmax(T &a, const U &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
    os << "(" << rhs.first << ", " << rhs.second << ")";
    return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
    os << "{";
    for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
        os << *itr << (next(itr) != rhs.end() ? ", " : "");
    }
    os << "}";
    return os;
}
struct setup {
    static constexpr int PREC = 20;
    setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} setup;

template<typename T>
struct fenwick_tree_range {
    int n;
    T zero;
    std::vector<T> data;
    fenwick_tree_range(int n, T zero = T()) : n(n), zero(zero), data(n + 1, zero) {}
    void add(int i, T x) { for (i++; i <= n; i += i & -i) { data[i] += x; }}
    void add(int l, int r, T x) { add(l, x), add(r, -x); }
    T operator[](int i) const {
        if (i >= n) { i = n - 1; }
        T ret = zero;
        for (i++; i > 0; i -= i & -i) { ret += data[i]; }
        return ret;
    }
};

int N;
int c[220000];
int a[220000], b[220000];
vint G[220000];
int ans[220000];
stack<int> st[220000];
fenwick_tree_range<int> ft(220000);
void dfs(int x, int par) {
    int cur = c[x];
    ft.add(0, cur, 1), ft.add(cur + 1, N, 1);
    rep(i, G[x].size()) {
        st[cur].push(ft[cur]);
        ft.add(cur, cur + 1, -ft[cur]);
        if (G[x][i] != par) { dfs(G[x][i], x); }
        int k = ft[cur];
        ans[cur] -= k * (k + 1) / 2;
        ft.add(cur, cur + 1, st[cur].top() - k);
        st[cur].pop();
    }
}

signed main() {
    cin >> N;
    rep(i, N) {
        cin >> c[i];
        c[i]--;
        ans[c[i]] = N * (N + 1) / 2;
    }
    rep(i, N - 1) {
        cin >> a[i] >> b[i];
        a[i]--, b[i]--;
        G[a[i]].push_back(b[i]);
        G[b[i]].push_back(a[i]);
    }
    dfs(0, -1);
    rep(i, N) {
        if (ans[i] > 0) {
            int k = ft[i];
            ans[i] -= k * (k + 1) / 2;
        }
    }
    rep(i, N) { cout << ans[i] << endl; }
}

Measured memory_bytes: 198724