#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
struct edge {
  int to, nxt, weight;
} e[maxn * 2];
int n, sz[maxn], sum[maxn];
int dep[maxn], cnt;
int head[maxn], tot;
int parent[maxn], hson[maxn];
void init() {
  tot = 0;
  memset(head, -1, sizeof(head));
}
void add(int u, int v) {
  e[tot].to = v;
  e[tot].nxt = head[u];
  head[u] = tot++;
}
void dfs1(int u, int fa, int root) {
  parent[u] = fa;
  dep[u] = dep[fa] + 1;
  sz[u] = 1;
  for (int i = head[u], v; i != -1; i = e[i].nxt) {
    v = e[i].to;
    if (v == fa) continue;
    dfs1(v, u, root);
    sz[u] += sz[v];
    if (sz[v] > sz[hson[u]]) hson[u] = v;
  }
}
int mx[maxn], c[maxn], colcnt[maxn], Son;
long long ans[maxn];
void cal(int rt, int u, int val) {
  colcnt[c[u]] += val;
  if (val == 1) {
    if (colcnt[c[u]] > mx[rt])
      ans[rt] = c[u], mx[rt] = colcnt[c[u]];
    else if (colcnt[c[u]] == mx[rt])
      ans[rt] += c[u];
  }
  for (int i = head[u], v; i != -1; i = e[i].nxt) {
    v = e[i].to;
    if (v == parent[u] || v == Son) continue;
    cal(rt, v, val);
  }
}
void solve(int u, bool isson) {
  for (int i = head[u], v; i != -1; i = e[i].nxt) {
    v = e[i].to;
    if (v == parent[u] || v == hson[u]) continue;
    solve(v, 0);
  }
  if (hson[u])
    solve(hson[u], 1), Son = hson[u], mx[u] = mx[Son], ans[u] = ans[Son];
  cal(u, u, 1);
  Son = 0;
  if (!isson) cal(u, u, -1);
}
int main() {
  init();
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &c[i]);
  for (int i = 1, x, y; i <= n - 1; ++i) {
    scanf("%d%d", &x, &y);
    add(x, y);
    add(y, x);
  }
  dfs1(1, 0, 1);
  solve(1, 1);
  for (int i = 1; i <= n; ++i) printf("%lld%c", ans[i], i == n ? '\n' : ' ');
  return 0;
}
