#include <bits/stdc++.h>
using namespace std;
class Task {
 public:
  vector<int> color;
  vector<vector<int>> g;
  vector<long long> ans;
  class subtree {
   public:
    unordered_map<int, int> color_cnt;
    int max;
    long long max_sum;
  };
  subtree* merge(subtree* a, subtree* b) {
    if (((int)a->color_cnt.size()) < ((int)b->color_cnt.size())) {
      swap(a, b);
    }
    for (auto p : b->color_cnt) {
      int c = p.first;
      int c_cnt = p.second;
      a->color_cnt[c] += c_cnt;
      if (a->color_cnt[c] > a->max) {
        a->max = a->color_cnt[c];
        a->max_sum = c;
      } else if (a->color_cnt[c] == a->max) {
        a->max_sum += c;
      }
    }
    b->color_cnt.clear();
    return a;
  }
  subtree* dfs(int v, int p = -1) {
    subtree* res = new subtree();
    res->color_cnt[color[v]] = 1;
    res->max = 1;
    res->max_sum = color[v];
    for (int u : g[v]) {
      if (u == p) continue;
      res = merge(dfs(u, v), res);
    }
    ans[v] = res->max_sum;
    return res;
  }
  void solve() {
    int n;
    scanf("%d", &n);
    color.resize(n);
    for (int i = 0; i < n; i++) scanf("%d", &color[i]);
    g.resize(n);
    for (int i = 1; i < n; i++) {
      int u, v;
      scanf("%d %d", &u, &v);
      u--, v--;
      g[u].push_back(v);
      g[v].push_back(u);
    }
    ans.resize(n);
    dfs(0);
    for (int i = 0; i < n; i++) printf("%lld ", ans[i]);
    puts("");
  }
};
int main() {
  int T = 1;
  for (int t = 1; t <= T; t++) {
    (new Task())->solve();
  }
  return 0;
}
