#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <string>

using namespace std;

#define LL long long

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};

LL mod(LL x, LL md) {
	return ((x % md) + md) % md;
}

class Mint {
public:
	static LL md;
	LL x;
	Mint(LL _x) {
		x = mod(_x, md);
	}
	Mint(const Mint &y) {
		x = mod(y.x, md);
	}
};

void MintMyExgcd(LL a, LL b, LL &x, LL &y) {
	// solve equation ax + by = 1 (mod m)
	LL md = Mint::md;
	if (b == 0) {
		y = 0;
		x = 1;
		return ;
	}
	MintMyExgcd(b, a % b, x, y);
	LL t = y;
	y = mod(x - (a / b) * y, md);
	x = t;
}

LL MintNY(LL x) {
	if (x == 0) {
		return 1;
	}
	LL md = Mint::md;
	LL a, b;
	MintMyExgcd(x, md, a, b);
	while (a < 0) {
		a += md;
	}
	return a;
}

/* LL gcd(LL a, LL b) {
	if (b == 0) {
		return a;
	}
	return gcd(b, a % b);
} */

Mint operator+(Mint a, Mint b) {
	return Mint(mod(a.x + b.x, Mint::md));
}
Mint operator-(Mint a, Mint b) {
	return Mint(mod(a.x - b.x, Mint::md));
}
Mint operator*(Mint a, Mint b) {
	return Mint(mod(a.x * b.x, Mint::md));
}
Mint operator/(Mint a, Mint b) {
	Mint c = Mint(MintNY(b.x));
	return Mint(mod(a.x * c.x, Mint::md));
}

Mint operator-(Mint a) {
	return Mint(-a.x);
}
bool operator==(Mint a, Mint b) {
	return a.x == b.x;
}
bool operator!=(Mint a, Mint b) {
	return a.x != b.x;
}
bool operator>(Mint a, Mint b) {
	return a.x > b.x;
}
bool operator<(Mint a, Mint b) {
	return a.x < b.x;
}
bool operator>=(Mint a, Mint b) {
	return a.x >= b.x;
}
bool operator<=(Mint a, Mint b) {
	return a.x <= b.x;
}

void operator+=(Mint &a, Mint b) {
	a = a + b;
}
void operator-=(Mint &a, Mint b) {
	a = a - b;
}
void operator*=(Mint &a, Mint b) {
	a = a * b;
}
void operator/=(Mint &a, Mint b) {
	a = a / b;
}

ostream& operator<<(ostream &out, Mint a) {
	out << a.x;
	return out;
}

istream& operator>>(istream &in, Mint &a) {
	in >> a.x;
	return in;
}

Mint factorial(LL n) {
	if (n == 0) {
		return Mint(1);
	}
	Mint res = 1;
	for (LL i = 1; i <= n; ++i) {
		res *= i;
	}
	return res;
}
Mint multiRange(LL s, LL t) {
	Mint res = 1;
	for (LL i = s; i <= t; ++i) {
		res *= i;
	}
	return res;
}

Mint getC(LL n, LL k) {
	if (n - k < k) {
		return getC(n, n - k);
	}
	return multiRange(n - k + 1, n) / factorial(k);
}

Mint getA(LL n, LL k) {
	return multiRange(n - k + 1, n);
}

Mint countNonNegativeDivision(LL n, LL k) {
	return getC(n + k - 1, k - 1);
}
Mint countPositiveDivision(LL n, LL k) {
	if (n < k) {
		return 0;
	}
	if (k <= 0) {
		return 0;
	}
	return getC(n - 1, k - 1);
}
Mint quickMod(Mint a, LL b) {
	Mint res = 1;
	while (b > 0) {
		if (b % 2) {
			res *= a;
		}
		a *= a;
		b /= 2;
	}
	return res;
}

LL Mint::md = 1000000007;

class Edge {
public:
	int t, nxt;
	bool isDir;
	Edge(int _t, int _nxt, bool _isDir = false): t(_t), nxt(_nxt), isDir(_isDir) {}
};

class Tree {
public:
	int n;
	vector<Edge> e;
	int edgeN;
	vector<int> h;
	vector<int> s, f;
	vector<int> c;
	vector<int> cS;
	vector<LL> res;
	int root;
	vector<bool> vis;

	void addEdge(int u, int v) {
		// printf("addEdge(%d, %d)", u, v);
		e.push_back(Edge(v, h[u]));
		h[u] = edgeN++;
		e.push_back(Edge(u, h[v]));
		h[v] = edgeN++;
	}

	void initDFS(int r) {
		s[r] = 1;
		vis[r] = true;
		for (int p = h[r]; p != -1; p = e[p].nxt) {
			int t = e[p].t;
			// printf("edge between (%d, %d)\n", r, t);
			if (vis[t]) {
				e[p].isDir = false;
				continue;
			}
			e[p].isDir = true;
			f[t] = r;
			initDFS(t);
			s[r] += s[t];
		}
	}

	void initialize(int _root = 0) {
		root = _root;
		for (int i = 0; i < n; ++i) {
			s.push_back(0);
			f.push_back(-1);
			vis.push_back(false);
		}
		initDFS(root);
	}

	void printVector(vector<int> &x, string name) {
		cout << name << ": ";
		for (int i = 0; i < x.size(); ++i) {
			cout << x[i] << ' ';
		}
		cout << endl;
	}

	void checkOutput() {
		// printVector(s, "s");
		// printVector(f, "f");
		// printVector(h, "h");
		// cout << "root = " << root << endl;
	}

	Tree() {
		scanf("%d", &n);
		edgeN = 0;

		h.clear();
		for (int i = 0; i < n; ++i) {
			h.push_back(-1);
			c.push_back(0);
		}

		for (int i = 0; i < n; ++i) {
			scanf("%d", &c[i]);
			c[i] -= 1;
		}

		int u, v;
		for (int i = 0; i < n - 1; ++i) {
			scanf("%d%d", &u, &v);
			addEdge(u - 1, v - 1);
		}

		initialize();
		checkOutput();
	}

	vector<int> childS(int r) {
		vector<int> res;
		res.clear();
		for (int p = h[r]; p != -1; p = e[p].nxt) {
			if (e[p].isDir) {
				res.push_back(s[e[p].t]);
			}
		}
		return res;
	}
	LL countPair(vector<int> &cs, int kn) {
		int total = 0;
		for (int i = 0; i < cs.size(); ++i) {
			total += cs[i];
		}
		int rest = kn - total - 1;
		cs.push_back(rest);
		LL res = 0;
		for (int i = 0; i < cs.size(); ++i) {
			res += (LL)(cs[i]) * (LL)(kn - cs[i]);
		}
		res += (kn - 1);
		res /= 2;
		return res;
	}

	void workDFS(int r) {
		int k = c[r];
		vector<int> cs = childS(r);
		// cout << "r = " << r << " ";
		// printVector(cs, "cs");
		int kn = cS[k]; // include r itself
		LL localCount = countPair(cs, kn);
		// cout << "count = " << localCount << endl;
		res[k] += localCount;
		
		for (int p = h[r]; p != -1; p = e[p].nxt) {
			if (!e[p].isDir) {
				continue;
			}
			int t = e[p].t;
			cS[k] = s[t];
			workDFS(t);
		}
		cS[k] = kn - s[r];
	}

	void work() {
		cS.clear();
		res.clear();
		for (int i = 0; i < n; ++i) {
			cS.push_back(n);
			res.push_back(0);
		}
		workDFS(root);
		for (int i = 0; i < n; ++i) {
			res[c[i]] += 1;
		}

		for (int i = 0; i < n; ++i) {
			printf("%lld\n", res[i]);
		}
	}
	~Tree() {
	}
};

int main() {
	Tree t;
	t.work();
	return 0;
}

Measured memory_bytes: 38204