#include <bits/stdc++.h>
using namespace std;
const int N = 200001;
struct node {
  int nxt, to;
} e[N << 1];
int head[N], cnt = 0, siz[N], son[N], fa[N], max_son, col[N], a[N], maxx, n, x,
             y, Son;
long long sum, ans[N];
void add(int u, int v) {
  e[++cnt].nxt = head[u];
  head[u] = cnt;
  e[cnt].to = v;
}
void dfs(int u, int f, int d) {
  fa[u] = f, siz[u] = 1;
  int max_son = 0;
  for (int i = head[u]; i; i = e[i].nxt) {
    if (e[i].to == f) continue;
    dfs(e[i].to, u, d + 1);
    siz[u] += siz[e[i].to];
    if (siz[e[i].to] > max_son) max_son = siz[e[i].to], son[u] = e[i].to;
  }
}
void calc(int u, int val) {
  col[a[u]] += val;
  if (col[a[u]] > maxx)
    maxx = col[a[u]], sum = a[u];
  else if (col[a[u]] == maxx)
    sum += (long long)a[u];
  for (int i = head[u]; i; i = e[i].nxt) {
    if (e[i].to == fa[u] || e[i].to == Son) continue;
    calc(e[i].to, val);
  }
}
void dfs2(int u, int opt) {
  for (int i = head[u]; i; i = e[i].nxt) {
    if (e[i].to == son[u] || e[i].to == fa[u]) continue;
    dfs2(e[i].to, 0);
  }
  if (son[u]) dfs2(son[u], 1), Son = son[u];
  calc(u, 1);
  ans[u] = sum;
  Son = 0;
  if (!opt) calc(u, -1), sum = maxx = 0;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &x, &y);
    add(x, y), add(y, x);
  }
  dfs(1, 0, 1);
  dfs2(1, 0);
  for (int i = 1; i <= n; i++) printf("%lld ", ans[i]);
  return 0;
}
