#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000 * 200;
int color[MAXN];
long long sum[MAXN], sz[MAXN];
vector<int> g[MAXN];
int was[MAXN];
typedef map<long long, long long>* pmap;
pmap m[MAXN];
pmap merge(pmap a, pmap b, long long& sum, long long& sz) {
  if (a->size() > b->size()) {
    return merge(b, a, sum, sz);
  }
  for (auto it : *a) {
    (*b)[it.first] += it.second;
    long long buf_sz = (*b)[it.first];
    if (sz < buf_sz) {
      sz = buf_sz;
      sum = it.first;
    } else {
      if (sz == buf_sz) {
        sum += it.first;
      }
    }
  }
  return b;
}
void dfs(int v) {
  m[v] = new map<long long, long long>();
  was[v] = 1;
  (*m[v])[color[v]] = 1;
  sum[v] = color[v];
  sz[v] = 1;
  for (int u : g[v]) {
    if (!was[u]) {
      dfs(u);
      if (m[v]->size() < m[u]->size()) {
        sum[v] = sum[u];
        sz[v] = sz[u];
      }
      m[v] = merge(m[u], m[v], sum[v], sz[v]);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> color[i];
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(0);
  for (int i = 0; i < n; i++) {
    cout << sum[i] << "\n";
  }
  return 0;
}
