#include <bits/stdc++.h>
using namespace std;
vector<long long> G[100005];
long long n, cnt, ans;
long long c[100005], son[100005], siz[100005], num[100005], result[100005];
void dfs1(long long u, long long fa) {
  siz[u] = 1;
  for (long long i = 0; i < G[u].size(); i++) {
    long long v = G[u][i];
    if (v == fa) continue;
    dfs1(v, u);
    siz[u] += siz[v];
    if (!son[u] || siz[v] > siz[son[u]]) son[u] = v;
  }
}
void modify(long long u, long long fa, bool flag) {
  if (flag) {
    num[c[u]]++;
    if (num[c[u]] > cnt)
      cnt = num[c[u]], ans = c[u];
    else if (num[c[u]] == cnt)
      ans += c[u];
  } else
    num[c[u]]--;
  for (long long i = 0; i < G[u].size(); i++)
    if (G[u][i] != fa) modify(G[u][i], u, flag);
}
void dfs2(long long u, long long fa) {
  for (long long i = 0; i < G[u].size(); i++) {
    long long v = G[u][i];
    if (v == fa || v == son[u]) continue;
    dfs2(v, u);
    modify(v, u, 0);
    cnt = ans = 0;
  }
  if (son[u]) dfs2(son[u], u);
  for (long long i = 0; i < G[u].size(); i++) {
    long long v = G[u][i];
    if (v == fa || v == son[u])
      continue;
    else
      modify(v, u, 1);
  }
  num[c[u]]++;
  if (num[c[u]] > cnt)
    ans = c[u], cnt = num[c[u]];
  else if (num[c[u]] == cnt)
    ans += c[u];
  result[u] = ans;
}
signed main() {
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++) scanf("%lld", &c[i]);
  for (long long i = 1, u, v; i < n; i++) {
    scanf("%lld %lld", &u, &v);
    G[u].push_back(v);
    G[v].push_back(u);
  }
  dfs1(1, 0);
  dfs2(1, 0);
  for (long long i = 1; i <= n; i++) printf("%lld ", result[i]);
  return 0;
}
