#include <bits/stdc++.h>
using namespace std;
void read(bool out = 0) {}
long long a[100009];
vector<vector<long long> > ad;
long long num[100009] = {};
void dfs(long long u, long long p) {
  num[u] = 1;
  for (auto v : ad[u]) {
    if (v == p) continue;
    dfs(v, u);
    num[u] += num[v];
  }
}
long long cont[100009] = {};
long long mx = -1;
long long buffer = 0;
long long ans[100009];
void add(long long u, long long p, long long big) {
  cont[a[u]]++;
  if (cont[a[u]] > mx) {
    mx = cont[a[u]];
    buffer = a[u];
  } else if (cont[a[u]] == mx) {
    buffer += a[u];
  }
  for (auto v : ad[u]) {
    if (v == p || v == big) continue;
    add(v, u, big);
  }
}
void del(long long u, long long p) {
  mx = -1;
  cont[a[u]]--;
  for (auto v : ad[u]) {
    if (v == p) continue;
    del(v, u);
  }
}
void dsu(long long u, long long p, long long heavy) {
  long long mx = -1;
  long long big;
  for (auto v : ad[u]) {
    if (v == p) continue;
    if (num[v] > mx) {
      mx = num[v];
      big = v;
    }
  }
  for (auto v : ad[u]) {
    if (v == p || v == big) continue;
    dsu(v, u, 0);
  }
  if (mx != -1) {
    dsu(big, u, 1);
  }
  add(u, p, big);
  ans[u] = buffer;
  if (!heavy) del(u, p);
}
int main() {
  read();
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  ad = vector<vector<long long> >(n + 1);
  for (int i = 0; i < n - 1; i++) {
    long long x, y;
    cin >> x >> y;
    x--, y--;
    ad[x].push_back(y);
    ad[y].push_back(x);
  }
  dfs(0, -1);
  dsu(0, -1, 0);
  for (int i = 0; i < n; i++) cout << ans[i] << " ";
}
