#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
bool mark[MAXN];
vector<long long int> v[MAXN];
map<long long int, long long int> mm[MAXN];
map<long long int, long long int> m;
long long int par[MAXN];
long long int sum[MAXN];
long long int mxx[MAXN];
long long int a[MAXN];
void DFS(long long int x) {
  mark[x] = true;
  if (v[x].size() == 1 && x != 1) {
    m[x] = x;
    mm[x][a[x]]++;
    sum[x] = a[x];
    mxx[x] = 1;
  } else {
    long long int mx = 0;
    long long int pnt = 0;
    for (auto i : v[x]) {
      if (mark[i]) continue;
      par[i] = x;
      DFS(i);
      if (mm[m[i]].size() > mx) {
        mx = mm[m[i]].size();
        pnt = i;
      }
    }
    m[x] = m[pnt];
    sum[x] = sum[pnt];
    mxx[x] = mxx[pnt];
    mm[m[x]][a[x]]++;
    if (mm[m[x]][a[x]] > mxx[x]) {
      mxx[x] = mm[m[x]][a[x]];
      sum[x] = a[x];
    } else if (mm[m[x]][a[x]] == mxx[x]) {
      sum[x] += a[x];
    }
    for (auto i : v[x]) {
      if (par[x] != i && i != pnt) {
        long long int mx = 0;
        for (auto j : mm[m[i]]) {
          mm[m[x]][j.first] += j.second;
          if (mm[m[x]][j.first] > mxx[x]) {
            mxx[x] = mm[m[x]][j.first];
            sum[x] = j.first;
          } else if (mm[m[x]][j.first] == mxx[x]) {
            sum[x] += j.first;
          }
        }
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n;
  cin >> n;
  for (long long int i = 1; i <= n; i++) cin >> a[i];
  for (long long int i = 1; i < n; i++) {
    long long int x, y;
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  DFS(1);
  for (long long int i = 1; i <= n; i++) cout << sum[i] << " ";
}
