#include <bits/stdc++.h>
using namespace std;
const int N = 100010, M = N << 1;
int n;
int w[N];
int head[N], nxt[M], to[M], tot;
long long sum[N], ans;
int cnt[N], mx, son[N], sz[N];
void add(int u, int v) {
  nxt[++tot] = head[u];
  head[u] = tot;
  to[tot] = v;
}
void dfs_son(int u, int fa) {
  sz[u] = 1;
  for (int i = head[u]; i; i = nxt[i]) {
    if (to[i] == fa) continue;
    dfs_son(to[i], u);
    sz[u] += sz[to[i]];
    if (sz[to[i]] > sz[son[u]]) son[u] = to[i];
  }
}
void update(int u, int fa, int x, int pson) {
  cnt[w[u]] += x;
  if (cnt[w[u]] > mx)
    mx = cnt[w[u]], ans = w[u];
  else if (cnt[w[u]] == mx)
    ans += w[u];
  for (int i = head[u]; i; i = nxt[i]) {
    if (to[i] == fa || to[i] == pson) continue;
    update(to[i], u, x, pson);
  }
}
void dfs(int u, int fa, int op) {
  for (int i = head[u]; i; i = nxt[i]) {
    if (to[i] == fa || to[i] == son[u]) continue;
    dfs(to[i], u, 0);
  }
  if (son[u]) dfs(son[u], u, 1);
  update(u, fa, 1, son[u]);
  sum[u] = ans;
  if (!op) update(u, fa, -1, 0), ans = mx = 0;
}
void solve() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
  int u, v;
  for (int i = 1; i < n; i++) {
    scanf("%d %d", &u, &v);
    add(u, v);
    add(v, u);
  }
  dfs_son(1, -1);
  dfs(1, -1, 1);
  for (int i = 1; i <= n; i++) printf("%lld ", sum[i]);
  puts("");
}
int main() {
  solve();
  return 0;
}
