#include <bits/stdc++.h>
using namespace std;
int n, x, y, Son, Max;
int tot, point[100005], nxt[100005 * 2], v[100005 * 2];
int c[100005], size[100005], son[100005], cnt[100005];
long long sum, ans[100005];
void add(int x, int y) {
  ++tot;
  nxt[tot] = point[x];
  point[x] = tot;
  v[tot] = y;
}
void getson(int x, int fa) {
  size[x] = 1;
  for (int i = point[x]; i; i = nxt[i])
    if (v[i] != fa) {
      getson(v[i], x);
      size[x] += size[v[i]];
      if (size[v[i]] > size[son[x]]) son[x] = v[i];
    }
}
void calc(int x, int fa, int val) {
  cnt[c[x]] += val;
  if (cnt[c[x]] > Max)
    sum = (long long)c[x], Max = cnt[c[x]];
  else if (cnt[c[x]] == Max)
    sum += (long long)c[x];
  for (int i = point[x]; i; i = nxt[i])
    if (v[i] != fa && v[i] != Son) calc(v[i], x, val);
}
void dfs(int x, int fa, int k) {
  for (int i = point[x]; i; i = nxt[i])
    if (v[i] != fa && v[i] != son[x]) dfs(v[i], x, 0);
  if (son[x]) dfs(son[x], x, 1), Son = son[x];
  calc(x, fa, 1);
  Son = 0;
  ans[x] = sum;
  if (!k) calc(x, fa, -1), Max = sum = 0;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &c[i]);
  for (int i = 1; i < n; ++i) {
    scanf("%d%d", &x, &y);
    add(x, y), add(y, x);
  }
  getson(1, 0);
  dfs(1, 0, 0);
  for (int i = 1; i <= n; ++i) printf("%I64d%c", ans[i], " \n"[i == n]);
}
