#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <array>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#ifdef DEBUG
#include "./Lib/debug.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* (=＾o＾=) */
//#define int ll

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline void sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline void rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline void unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline bool chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline bool chmaxE(T& t, const S& s) { if (s >= t) { t = s; return true; } return false; }
template<class T, class S>
inline bool chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline void BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;
using std::tuple;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
inline signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

/* constant value */
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;
//constexpr ll MOD = 2;

//=============================================================================================

template<class Lambda>
auto treeDP(long long n, const std::unordered_multimap<long long, long long>& graph, long long root, const Lambda& lambda) {
	VL out(n, 0);
	{
		std::queue<ll> q; q.emplace(root);
		while (!q.empty()) {
			auto from = q.front();
			q.pop();

			auto range = graph.equal_range(from);
			REPI2(itr, range.first, range.second) {
				auto to = itr->second;
				if (out[to] == 0) {
					q.emplace(to);
					++out[from];
				}
			}
		}
	}

	{
		std::queue<ll> q;
		V<bool> isUsed(n);
		REP(i, n)if (out[i] == 0) { q.emplace(i); isUsed[i] = true; }
		while (!q.empty()) {
			auto from = q.front();
			q.pop();

			auto range = graph.equal_range(from);
			REPI2(itr, range.first, range.second) {
				auto to = itr->second;

				if (!isUsed[to]) {
					lambda(from, to);
				}

				--out[to];
				if (out[to] == 0) {
					q.emplace(to);
					isUsed[to] = true;
				}
			}
		}
	}
}
signed main() {
	ll n;
	cin >> n;
	VL v(n);
	cin >> v;
	for (auto&& x : v) { --x; }
	unordered_multimap<ll, ll> graph;
	REP(_, n - 1) {
		ll a, b;
		cin >> a >> b;
		--a; --b;
		graph.emplace(a, b);
		graph.emplace(b, a);
	}
	VL treeSize(n, 1);
	treeDP(n, graph, 0, [&](ll from, ll to) {
		treeSize[to] += treeSize[from];
	});

	V<bool> non(n);
	REPC(x, v) { non[x] = true; }
	V<list<ll>> size(n);
	V<unordered_map<ll, ll>> dp(n);
	REP(i, n) { dp[i].emplace(v[i], treeSize[i]); }
	treeDP(n, graph, 0, [&](ll from, ll to) {

		ll ad = treeSize[from];
		if (dp[from].find(v[to]) != dp[from].end()) {
			ad -= dp[from][v[to]];
		}
		if (ad > 0) { size[v[to]].emplace_back(ad); }

		if (dp[from].size() > dp[to].size()) { std::swap(dp[from], dp[to]); }
		REPC(p, dp[from]) {
			dp[to][p.first] += p.second;
		}
		dp[to][v[to]] = treeSize[to];
		dp[from].clear();
	});

	REPC(p, dp[0]) {
		ll ad = treeSize[0] - p.second;
		if (ad <= 0) { continue; }
		size[p.first].emplace_back(ad);
	}
	ll all = n * (n + 1) / 2;
	dump(size);
	dump(all);
	REP(i, n) {
		if (!non[i]) { cout << 0 << endl; continue; }
		ll ans = all;
		REPC(x, size[i]) { ans -= x * (x + 1) / 2; }
		cout << ans << endl;
	}
}




Measured memory_bytes: 72032