#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#define endl codeforces
#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)
using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;
template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }
template <typename T> const T& clamp(const T &t, const T &low, const T &high) { return std::max(low, std::min(high, t)); }
template <typename T> void chclamp(T &t, const T &low, const T &high) { return t = clamp(t, low, high); }
template <typename T> T make_v(T init) { return init; }
template <typename T, typename... Tail> auto make_v(T init, std::size_t s, Tail... tail) { auto v = std::move(make_v(init, tail...)); return vec<decltype(v)>(s, v); }
template <typename T, std::size_t Head, std::size_t ...Tail> struct multi_dem_array { using type = std::array<typename multi_dem_array<T, Tail...>::type, Head>; };
template <typename T, std::size_t Head> struct multi_dem_array<T, Head> { using type = std::array<T, Head>; };
template <typename T, std::size_t ...Args> using mdarray = typename multi_dem_array<T, Args...>::type;
namespace init__ { struct InitIO { InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } } init_io; }

namespace graph {

using Node = ll;
using Weight = ll;
using Edge = std::pair<Node, Weight>;

template <bool Directed>
struct Graph : public vvec<Edge> {
    using vvec<Edge>::vvec;

    void add_edge(Node f, Node t, Weight w = 1) {
        (*this)[f].emplace_back(t, w);
        if (!Directed) (*this)[t].emplace_back(f, w);
    }

    Graph<Directed> build_inv() const {
        Graph<Directed> ret(this->size());
        for (Node i = 0; i < this->size(); i++) {
            for (const Edge &e : (*this)[i]) {
                Node j;
                Weight w;
                std::tie(j, w) = e;
                if (!Directed && j < i) continue;
                ret.add_edge(j, i, w);
            }
        }

        return ret;
    }
};

template <typename Iterator>
class dst_iterator {
    Iterator ite;

public:
    dst_iterator(Iterator ite) : ite(ite) { }

    bool operator ==(const dst_iterator<Iterator> &oth) const {
        return ite == oth.ite;
    }

    bool operator !=(const dst_iterator<Iterator> &oth) const {
        return !(*this == oth);
    }

    bool operator <(const dst_iterator<Iterator> &oth) const {
        return ite < oth.ite;
    }

    bool operator >(const dst_iterator<Iterator> &oth) const {
        return ite > oth.ite;
    }

    bool operator <=(const dst_iterator<Iterator> &oth) const {
        return ite <= oth.ite;
    }

    bool operator >=(const dst_iterator<Iterator> &oth) const {
        return ite >= oth.ite;
    }

    const Node& operator *() {
        return ite->first;
    }

    const Node& operator *() const {
        return ite->first;
    }

    dst_iterator operator ++() {
        ++ite;
        return ite;
    }
};

class dst_iteration {
    using ite_type = vec<Edge>::const_iterator;
    const vec<Edge> &edges;

public:
    dst_iteration(const vec<Edge> &edges) : edges(edges) { }

    auto begin() const {
        return dst_iterator<ite_type>(edges.cbegin());
    }

    auto end() const {
        return dst_iterator<ite_type>(edges.cend());
    }
};

dst_iteration dst(const vec<Edge> &edges) {
    return dst_iteration(edges);
}

}

struct Solver {
    ll n;
    graph::Graph<false> tree;
    vec<ll> color;
    vec<pll> pre_v;
    vec<ll> sz_sum;
    vvec<ll> sub_sz;
    tll terr;

    Solver(ll n) 
        : n(n), tree(n + 1), color(n), pre_v(n), sz_sum(n), sub_sz(n + 1), terr(-1, -1, -1)
    {
        for (ll &e : color) {
            std::cin >> e;
            e--;
        }
        for (ll i = 1; i < n; i++) {
            ll a, b;
            std::cin >> a >> b;
            tree.add_edge(a - 1, b - 1);
        }
        tree[n].emplace_back(0, 1);
    }

    ll dfs_sz(ll cur, ll pre) {
        ll ret = 1;
        for (ll nxt : graph::dst(tree[cur])) {
            ll rec = (nxt == pre ? 0 : dfs_sz(nxt, cur));
            sub_sz[cur].push_back(rec);
            ret += rec;
        }
        if (cur < n) sz_sum[cur] = ret;
        return ret;
    }

    void dfs_dec(ll cur, ll pre) {
        tll rback = terr;
        if (cur != n) {
            ll c = color[cur];
            ll a, b;
            std::tie(a, b) = pre_v[c];
            sub_sz[a][b] -= sz_sum[cur];
            rback = tll(c, a, b);
        }
        for (ll i = 0; i < tree[cur].size(); i++) {
            ll nxt = tree[cur][i].first;
            if (nxt == pre) continue;
            if (cur != n) pre_v[color[cur]] = pll(cur, i);
            dfs_dec(nxt, cur);
        }
        if (rback != terr) {
            ll a, b, c;
            std::tie(c, a, b) = rback;
            pre_v[c] = pll(a, b);
        }
    }

    vec<ll> solve() {
        dfs_sz(n, -1);
        sub_sz[n].resize(n);
        for (ll i = 0; i < n; i++) sub_sz[n][i] = n;
        for (ll i = 0; i < n; i++) pre_v[i] = pll(n, i);
        dfs_dec(n, -1);

        auto cnt_path = [&](ll sz) { return sz * (sz - 1) / 2 + sz; };

        vec<ll> ans(n, cnt_path(n));
        vvec<ll> cv(n);
        for (ll i = 0; i < n; i++) cv[color[i]].push_back(i);

        for (ll i = 0; i < n; i++) {
            ans[i] -= cnt_path(sub_sz[n][i]);
            for (ll e : cv[i]) for (ll s : sub_sz[e]) {
                ans[i] -= cnt_path(s);
            }
        }
        return ans;
    }
};

int main() {
    ll n;
    std::cin >> n;
    Solver solver(n);
    auto ans = solver.solve();
    for (ll e : ans) std::cout << e << '\n';
    return 0;
}


Measured memory_bytes: 65076