
// Problem : F - path pass i
// Contest : AtCoder - AtCoder Beginner Contest 163
// URL : https://atcoder.jp/contests/abc163/tasks/abc163_f
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)


#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")  //Optimization flags
#define pb push_back
#define IOS                                                                    \
  ios_base::sync_with_stdio(false);                                            \
  cin.tie(0);                                                                  \
  cout.tie(0);cout<<fixed<<setprecision(16);
#define ll long long int
#define ld long double
#define el '\n'
#define El '\n'
#define PI (ld)3.141592653589793238462643383279502884197169399375105820974944
#define inf (ll)1000000000
#define binf (ll)1000000000*(ll)1000000000
#define mod (ll)1000000007
#define mod1 (ll)998244353
#define fo(i, n) for (long long i = 0; i < n; i++)
#define pll pair<ll, ll>
#define ml map<ll,ll>
#define vpl vector<pll>
#define vvl vector<vector<ll> >
#define vvpl vector< vector<pll> >
#define ff first
#define ss second
#define pqueue priority_queue< ll >
#define pdqueue priority_queue< ll,vl ,greater< ll > >
#define mem(a,b) memset(a,b,sizeof(a));
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define sz(a) (ll)a.size()
#define all(a) a.begin(),a.end()
#define vl vector<ll>


/*#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }

void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
	cerr << *it << " = " << a << endl;
	err(++it, args...);
}*/


//#define x ff
//#define y ss
#define pt(a) for(auto it:a)cout<<it<<" ";cout<<endl;
unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();
using namespace std;

using namespace __gnu_pbds;
 
typedef tree<pll,null_type,less<pll>,rb_tree_tag,tree_order_statistics_node_update> order_set;

// vector
template<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }
template<class T> ostream& operator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << t<<" "; return os << endl; }
// pair
template<class T, class U> ostream& operator << (ostream &os , const pair<T, U> &v) { return os << v.first << " " << v.second ; }

double gcd(double a, double b) { return a < 0.01 ? b : gcd(fmod(b, a), a); }

long long bpow(long long a, long long b, long long m) {
  a %= m;
  long long res = 1;
  while (b > 0) {
    if (b & 1)res = res * a % m;
      a = a * a % m;
      b >>= 1;
  }
  return res;
}


ll kv;
ll t,n,x,y,h,k,z,p,q,w;
string s,s1,s2;
vvl v;
vl vis,d,c,ans;

void dfs1(ll s,ll p=-1){
	d[s]=1;
	for(ll u:v[s]){
		if(u==p)continue;
		dfs1(u,s);
		d[s]+=d[u];
	}
}

vl temp,rem;
map<ll,vl>m;

void dfs(ll s,ll p=-1){
	temp.pb(s);
	ll pre=-1;
	if(sz(m[c[s]])>0){
		pre=d[temp[m[c[s]].back()+1]];
	}
	else{
		pre=rem[c[s]];
		rem[c[s]]-=d[s];
		assert(rem[c[s]]>=0);
	}
	pre-=d[s];
	assert(pre>=0);
	m[c[s]].push_back(sz(temp)-1);
	ll x=pre,y=x*x;
	for(ll u:v[s]){
		if(u==p)continue;
		x+=d[u];y+=d[u]*d[u];
	}
	ans[c[s]]+=(x*x-y)/2+d[s]+pre;
	
	for(ll u:v[s]){
		if(u==p)continue;
		dfs(u,s);
	}
	
	temp.pop_back();
	m[c[s]].pop_back();
}

void solve(){
	cin>>n;
	v.resize(n);
	d.assign(n,0);
	c.resize(n);
	ans.resize(n);
	rem.assign(n,n);
	cin>>c;
	fo(i,n)c[i]--;
	
	fo(i,n-1){
		cin>>x>>y;x--;y--;
		v[x].pb(y);v[y].pb(x);
	}
	//cout<<n<<endl;
	dfs1(0);
	dfs(0);
	fo(i,n)cout<<ans[i]<<el;
}

int main() {
    IOS;
    //cin>>t;
    t=1;	
	fo(l,t){
		//cout<<"Case #"<<l+1<<": ";
		solve();
	}
    return 0;
}
