#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) //std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) //std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) //std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

ll n;
vvi g;
vi color;
vector<stack<ll> > stk;
vi partial_size;
vll complement;

void calc_partial_size(int root, int prev) {
  partial_size[root] = 1;
  for (int u : g[root]) {
    if (u == prev) {
      continue;
    }
    calc_partial_size(u, root);
    partial_size[root] += partial_size[u];
  }
}

ll calc_complement(ll sz) {
  return sz * (sz + 1) / 2;
}

void dfs(int root, int prev) {
  int col = color[root];
  stk[col].top() -= partial_size[root];
  for (int u : g[root]) {
    if (u == prev) {
      continue;
    }
    stk[col].push(partial_size[u]);
    dfs(u, root);
    complement[col] += calc_complement(stk[col].top());
    stk[col].pop();
  }
}

void solve() {
  scan(n);
  color.resize(n);
  scan(color);
  rep (i, n) {
    color[i] -= 1;
  }
  g.resize(n);
  rep (i, n-1) {
    int a, b;
    scan(a, b);
    --a; --b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  partial_size.assign(n, 0);
  calc_partial_size(0, -1);
  stk.resize(n);
  rep (i, n) {
    stk[i].push(n);
  }
  complement.assign(n, 0);
  dfs(0, -1);
  rep (i, n) {
    assert (stk[i].size() == 1);
    debug2(i, stk[i].top());
    complement[i] += calc_complement(stk[i].top());
  }
  debug(complement);
  ll all_path = n * (n + 1) / 2;
  rep (i, n) {
    print(all_path - complement[i]);
  }
}

int main() {
  solve();
  return 0;
}


Measured memory_bytes: 852892