#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int n, u, v, cnt, tot[N], mx, col[N], sz[N], son[N], h[N], to[N], nxt[N];
long long ans[N], sm;
bool skip[N];
void add(int u, int v) {
  to[++cnt] = v;
  nxt[cnt] = h[u];
  h[u] = cnt;
}
void get(int x, int fa) {
  sz[x] = 1;
  for (int i = h[x], k; i; i = nxt[i])
    if ((k = to[i]) != fa) {
      get(k, x);
      sz[x] += sz[k];
      if (sz[k] > sz[son[x]]) son[x] = k;
    }
}
void dfs(int x, int fa, int op) {
  tot[col[x]] += op;
  if (op > 0 && tot[col[x]] >= mx) {
    if (tot[col[x]] > mx) sm = 0, mx = tot[col[x]];
    sm += col[x];
  }
  for (int i = h[x], k; i; i = nxt[i])
    if ((k = to[i]) != fa && !skip[k]) dfs(k, x, op);
}
void work(int x, int fa, bool cl) {
  for (int i = h[x], k; i; i = nxt[i])
    if ((k = to[i]) != fa && k != son[x]) work(k, x, 1);
  if (son[x]) work(son[x], x, 0), skip[son[x]] = 1;
  dfs(x, fa, 1);
  ans[x] = sm;
  skip[son[x]] = 0;
  if (cl) dfs(x, fa, -1), mx = sm = 0;
}
int main() {
  scanf("%d", &n);
  for (int i = (1); i <= (n); i++) scanf("%d", &col[i]);
  for (int i = (2); i <= (n); i++) scanf("%d%d", &u, &v), add(u, v), add(v, u);
  get(1, 0);
  work(1, 0, 0);
  for (int i = (1); i <= (n); i++) cout << ans[i] << ' ';
  return 0;
}
