#include <bits/stdc++.h>
using namespace std;
const int N = 1500005;
struct Tree {
  vector<int> adj[N];
  int ld[N], rd[N], sz[N];
  int id[N];
  int big[N];
  int n, ind, rt;
  void trprint() {
    cout << "rt=" << rt << ' ' << "n=" << n << endl;
    for (int i = 1; i <= n; ++i)
      cout << "i=" << i << ' ' << ld[i] << ' ' << rd[i] << ' ' << sz[i] << ' '
           << big[i] << endl;
  }
  void trinit() {
    for (int i = 1; i <= n; ++i) adj[i].clear();
    n = ind = 0;
    rt = 1;
  }
  void addedge(const int x, const int y) {
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  void trdfs(int x, int pre) {
    ld[x] = ++ind;
    id[ind] = x;
    sz[x] = 1;
    big[x] = 0;
    for (auto &y : adj[x])
      if (y != pre) {
        trdfs(y, x);
        sz[x] += sz[y];
        if (sz[y] > sz[big[x]]) big[x] = y;
      }
    rd[x] = ld[x] + sz[x] - 1;
  }
};
int cnt[N], tmp[N], mxt;
struct DsuOnTree : Tree {
  int col[N];
  long long ans[N];
  void dsuprint() {
    for (int i = 1; i <= n; ++i)
      cout << "i=" << i << ' ' << col[i] << ' ' << ans[i] << endl;
  }
  void dfs(int x, int pre, int keep) {
    for (auto &y : adj[x])
      if (y != pre && y != big[x]) dfs(y, x, 0);
    if (big[x]) dfs(big[x], x, 1);
    ans[x] = ans[big[x]];
    ++cnt[col[x]];
    if (cnt[col[x]] > mxt)
      mxt = cnt[col[x]], ans[x] = col[x];
    else if (cnt[col[x]] == mxt)
      ans[x] += col[x];
    for (auto &y : adj[x])
      if (y != pre && y != big[x]) {
        for (int i = ld[y]; i <= rd[y]; ++i) {
          ++cnt[col[id[i]]];
          if (cnt[col[id[i]]] > mxt)
            mxt = cnt[col[id[i]]], ans[x] = col[id[i]];
          else if (cnt[col[id[i]]] == mxt)
            ans[x] += col[id[i]];
        }
      }
    if (!keep) {
      mxt = 0;
      for (int i = ld[x]; i <= rd[x]; ++i) --cnt[col[id[i]]];
    }
  }
} tr;
int n;
int main() {
  tr.trinit();
  cin >> n;
  tr.n = n;
  for (int i = 1; i <= n; ++i) scanf("%d", &tr.col[i]);
  for (int i = 1, x, y; i < n; ++i) scanf("%d%d", &x, &y), tr.addedge(x, y);
  tr.trdfs(1, 0);
  tr.dfs(1, 0, 0);
  for (int i = 1; i <= n; ++i) printf("%lld ", tr.ans[i]);
  puts("");
  return 0;
}
