#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0;
  char ch = getchar();
  for (; ch < '0' || ch > '9'; ch = getchar())
    ;
  for (; ch <= '9' && ch >= '0'; x = x * 10 + ch - 48, ch = getchar())
    ;
  return x;
}
map<long long, long long> s[100010];
map<long long, long long>::iterator it;
long long i, j, k, m, n, x, y, w[100010], cnt, last[100010], a[100010],
    ans[100010], mx[100010], id[100010], as[100010];
struct edge {
  long long to, next;
} e[100010 << 1];
inline void add(long long u, long long v) {
  e[++cnt] = (edge){v, last[u]}, last[u] = cnt;
  e[++cnt] = (edge){u, last[v]}, last[v] = cnt;
}
inline void merge(long long x, long long y) {
  if (s[id[x]].size() < s[id[y]].size()) swap(id[x], id[y]);
  for (it = s[id[y]].begin(); it != s[id[y]].end(); ++it) {
    long long k = (*it).first, z = (*it).second;
    if ((s[id[x]][k] += z) > mx[id[x]]) mx[id[x]] = s[id[x]][k], ans[id[x]] = 0;
    if (s[id[x]][k] == mx[id[x]]) ans[id[x]] += k;
  }
}
void dfs(long long x, long long fa) {
  for (long long i = last[x], y; i; i = e[i].next)
    if ((y = e[i].to) != fa) dfs(y, x), merge(x, y);
  as[x] = ans[id[x]];
}
int main() {
  for (n = read(), i = 1; i <= n; ++i)
    s[i][ans[i] = w[i] = read()] = 1, mx[id[i] = i] = 1;
  for (i = 1; i < n; ++i) add(read(), read());
  for (dfs(1, 0), i = 1; i <= n; ++i) printf("%I64d ", as[i]);
}
