#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define all(V) V.begin(),V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX/2;
constexpr lint LINF = LLONG_MAX/2;
constexpr double eps = DBL_EPSILON;
constexpr double PI=3.141592653589793238462643383279;
template<class T>
class prique :public std::priority_queue<T, std::vector<T>, std::greater<T>> {};
template <class T, class U>
inline bool chmax(T& lhs, const U& rhs) {
	if (lhs < rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
template <class T, class U>
inline bool chmin(T& lhs, const U& rhs) {
	if (lhs > rhs) {
		lhs = rhs;
		return 1;
	}
	return 0;
}
inline lint gcd(lint a, lint b) {
	while (b) {
		lint c = a;
		a = b; b = c % b;
	}
	return a;
}
inline lint lcm(lint a, lint b) {
	return a / gcd(a, b) * b;
}
bool isprime(lint n) {
	if (n == 1)return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0)return false;
	}
	return true;
}
template<typename T>
T mypow(T a, lint b) {
	if (!b)return T(1);
	if (b & 1)return mypow(a, b - 1) * a;
	T memo = mypow(a, b >> 1);
	return memo * memo;
}
lint modpow(lint a, lint b, lint m) {
	if (!b)return 1;
	if (b & 1)return modpow(a, b - 1, m) * a % m;
	lint memo = modpow(a, b >> 1, m);
	return memo * memo % m;
}
template<typename T>
void printArray(std::vector<T>& vec) {
	rep(i, vec.size() - 1)std::cout << vec[i] << " ";
	std::cout << vec.back() << std::endl;
}
template<typename T>
void printArray(T l, T r) {
	T rprev = r;
	rprev--;
	for (T i = l; i != rprev; i++) {
		std::cout << *i << " ";
	}
	std::cout << *rprev << std::endl;
}
#line 2 "main.cpp"
int n,c[200010],sz[200010],d[200010];
lint ans[200010];
std::vector<int> vec[200010];
bool used[200010];
void dfs1(int node){
	used[node]=true;
	sz[node]=1;
	for(int i:vec[node]){
		if(!used[i]){
			dfs1(i);
			sz[node]+=sz[i];
		}
	}
}
void dfs2(int node){
	used[node]=true;
	int memo=d[c[node]];
	for(int i:vec[node]){
		if(!used[i]){
			int before=d[c[node]];
			dfs2(i);
			ans[c[node]]-=(lint)(sz[i]-(d[c[node]]-before))*(sz[i]-(d[c[node]]-before)+1)/2;
		}
	}
	d[c[node]]=memo+sz[node];
}
int main(){
	std::cin>>n;
	REP(i,n)std::cin>>c[i];
	rep(i,n-1){
		int a,b;
		std::cin>>a>>b;
		vec[a].emplace_back(b);
		vec[b].emplace_back(a);
	}
	dfs1(1);
	memset(used,false,sizeof(used));
	std::fill(ans+1,ans+n+1,(lint)n*(n+1)/2);
	dfs2(1);
	REP(i,n){
		ans[i]-=(lint)(n-d[i])*(n-d[i]+1)/2;
		std::cout<<ans[i]<<std::endl;
	}
}

Measured memory_bytes: 34260