#include <bits/stdc++.h>
using namespace std;
int n, cnt;
int col[100010], ehead[100010];
long long ans[100010];
struct ed {
  int to, nxt;
} e[100010 << 1];
map<int, int> mp[100010];
map<int, long long> sum[100010];
map<int, int>::iterator it1, it2;
inline int read() {
  int x = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x;
}
void prework() {
  for (int i = 1; i <= n; i++)
    col[i] = read(), mp[i][col[i]] = 1, sum[i][1] = col[i];
  int u, v;
  cnt = 0;
  for (int i = 1; i <= n - 1; i++) {
    u = read();
    v = read();
    e[++cnt].to = v;
    e[cnt].nxt = ehead[u];
    ehead[u] = cnt;
    e[++cnt].to = u;
    e[cnt].nxt = ehead[v];
    ehead[v] = cnt;
  }
}
void dfs(int u, int fa) {
  for (int i = ehead[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v != fa) {
      dfs(v, u);
      if (mp[u].size() < mp[v].size()) swap(mp[u], mp[v]), swap(sum[u], sum[v]);
      for (it1 = mp[v].begin(); it1 != mp[v].end(); ++it1) {
        sum[u][mp[u][(*it1).first]] -= (*it1).first;
        mp[u][(*it1).first] += (*it1).second;
        sum[u][mp[u][(*it1).first]] += (*it1).first;
      }
    }
  }
  ans[u] = (*sum[u].rbegin()).second;
}
void mainwork() { dfs(1, 0); }
void print() {
  for (int i = 1; i <= n; i++) printf("%I64d ", ans[i]);
  printf("\n");
}
int main() {
  while (~scanf("%d", &n)) {
    prework();
    mainwork();
    print();
  }
  return 0;
}
