#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
vector<int> g[N];
int n, c[N], sz[N], num[N], ma[N];
long long sum[N], ans[N];
void getsz(int u, int fa) {
  int siz = g[u].size();
  sz[u] = 1;
  for (int i = 0; i < siz; i++) {
    int v = g[u][i];
    if (v == fa) continue;
    getsz(v, u);
    sz[u] += sz[v];
  }
}
bool big[N];
void dfs1(int u, int fa, int x) {
  sum[num[c[u]]] -= c[u];
  num[c[u]] += x;
  ma[u] = num[c[u]];
  sum[num[c[u]]] += c[u];
  int siz = g[u].size();
  for (int i = 0; i < siz; i++) {
    int v = g[u][i];
    if (v == fa) continue;
    if (big[v]) {
      ma[u] = max(ma[u], ma[v]);
      continue;
    }
    dfs1(v, u, x);
    ma[u] = max(ma[v], ma[u]);
  }
}
void dfs(int u, int fa, bool keep) {
  int mx = -1, bigc = -1;
  int siz = g[u].size();
  for (int i = 0; i < siz; i++) {
    int v = g[u][i];
    if (v == fa) continue;
    if (sz[v] > mx) bigc = v, mx = sz[v];
  }
  for (int i = 0; i < siz; i++) {
    int v = g[u][i];
    if (v == fa || v == bigc) continue;
    dfs(v, u, 0);
  }
  if (bigc != -1) {
    dfs(bigc, u, 1);
    big[bigc] = 1;
  }
  dfs1(u, fa, 1);
  ans[u] = sum[ma[u]];
  if (bigc != -1) big[bigc] = 0;
  if (keep == 0) dfs1(u, fa, -1);
}
int main(void) {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &c[i]);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  getsz(1, 0);
  dfs(1, 0, 0);
  for (int i = 1; i <= n; i++) printf("%lld%c", ans[i], i == n ? '\n' : ' ');
  return 0;
}
