#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
long long ans[maxn];
vector<int> g[maxn];
int siz[maxn], son[maxn];
inline void dfs1(int u, int f) {
  siz[u] = 1;
  int maxson = -1;
  for (int v : g[u]) {
    if (v == f) continue;
    dfs1(v, u);
    siz[u] += siz[v];
    if (siz[v] > maxson) son[u] = v, maxson = siz[v];
  }
}
int flag;
long long sum, maxc;
long long col[maxn], cnt[maxn];
void Count(int x, int f, int val) {
  cnt[col[x]] += val;
  if (cnt[col[x]] > maxc) {
    maxc = cnt[col[x]];
    sum = col[x];
  } else if (cnt[col[x]] == maxc)
    sum += col[x];
  for (int v : g[x]) {
    if (v == f || v == flag) continue;
    Count(v, x, val);
  }
}
void DFS(int x, int f, bool keep) {
  for (int v : g[x]) {
    if (v == f || v == son[x]) continue;
    DFS(v, x, 0);
  }
  if (son[x]) {
    DFS(son[x], x, 1);
    flag = son[x];
  }
  Count(x, f, 1);
  flag = 0;
  ans[x] = sum;
  if (!keep) {
    Count(x, f, -1);
    sum = maxc = 0;
  }
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> col[i];
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs1(1, 0);
  DFS(1, 0, 0);
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  cout << endl;
  return 0;
}
