//Optional FAST

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")

//Required Libraries

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>

//Required namespaces

using namespace std;
using namespace __gnu_pbds;

//Required defines

#define endl '\n'

#define READ(X) cin>>X;
#define READV(X) long long X; cin>>X;
#define READAR(A,N) long long A[N]; for(long long i=0;i<N;i++) {cin>>A[i];}
#define rz(A,N) A.resize(N);
#define sz(X) (long long)(X.size())
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define trav(x,A) for(auto &x:A)
#define FORI(a,b,c) for(long long a=b;a<c;a++)
#define FORD(a,b,c) for(long long a=b;a>c;a--)

//Required typedefs

typedef tree<long long,null_type,less<long long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<long long,null_type,greater<long long>,rb_tree_tag,tree_order_statistics_node_update> ordered_set1;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
typedef vector<int> veci;
typedef vector<long long> vecl;

//Required Constants

const long long inf=(long long)1e18;
const long long MOD=(long long)(1e9+7);
const long long INIT=(long long)(1e6+1);

//Required Functions

ll power(ll x,ll y) 
{ 
    if (y == 0) 
        return 1; 
    ll p = power(x, y/2) % MOD; 
    p = (p * p) % MOD; 
  
    return (y%2 == 0)? p : (x * p) % MOD; 
}
ll modInverse(ll a) 
{ 
   return power(a,MOD-2); 
   
}

//Work

vector<ll> color;
vector<ll> color_count;
vector<vector<ll>> ADJ;
vector<ll> subtree_size;
vector<deque<ll>> Z;
vector<vector<ll>> col_grp;

void dfs_size(ll u,ll p=-1)
{
    subtree_size[u]=1;
    for(auto v:ADJ[u])
    {
        if(v!=p)
        {
            dfs_size(v,u);
            subtree_size[u]+=subtree_size[v];
        }
    }
}
void dfs_work(ll u,ll p=-1)
{
    color_count[color[u]]++;
    if(Z[color[u]].size()>0)
    {
        col_grp[color[u]][Z[color[u]].back()]-=subtree_size[u];
    }
    for(auto v:ADJ[u])
    {
        if(v!=p)
        {
            Z[color[u]].pb(col_grp[color[u]].size());
            col_grp[color[u]].pb(subtree_size[v]);
            dfs_work(v,u);
            Z[color[u]].pop_back();
        }
    }
}

int main()
{
    #ifndef ONLINE_JUDGE
    if (fopen("INPUT.txt", "r"))
    {
        freopen ("INPUT.txt" , "r" , stdin);
        //freopen ("OUTPUT.txt" , "w" , stdout);
    }
    #endif
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    clock_t clk;
    clk = clock();
//-----------------------------------------------------------------------------------------------------------//

    READV(N);
    color.resize(N+1,0);
    color_count.resize(N+1,0);
    ADJ.resize(N+1);
    subtree_size.resize(N+1,0);
    Z.resize(N+1);
    col_grp.resize(N+1);
    FORI(i,1,N+1)
    {
        READ(color[i]);
    }
    FORI(i,0,N-1)
    {
        READV(u);
        READV(v);
        ADJ[u].pb(v);
        ADJ[v].pb(u);
    }
    dfs_size(1);
    dfs_work(1);
    FORI(i,1,N+1)
    {
        ll ans=(N*(N-1)/2)+N;
        ll tot=N-color_count[i];
        for(auto x:col_grp[i])
        {
            ans-=(((x*(x-1))/2)+x);
            tot-=x;
        }
        ans-=(((tot*(tot-1))/2)+tot);
        cout<<ans<<endl;
    }

//-----------------------------------------------------------------------------------------------------------//


    clk = clock() - clk;
    cerr << fixed << setprecision(6) << "Time: " << ((double)clk)/CLOCKS_PER_SEC << endl;

    return 0;
}

Measured memory_bytes: 184044