#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
map<int, int> mp[maxn];
int long long n, m, sum[maxn], t[maxn], c[maxn], val[maxn];
vector<int> veci[maxn];
void dfs(int a, int b) {
  for (auto x : veci[a])
    if (x != b) {
      dfs(x, a);
      if (val[a] < val[x]) {
        swap(mp[a], mp[x]);
        swap(t[a], t[x]);
        sum[a] = sum[x];
      }
      val[a] += val[x];
      for (auto y : mp[x]) {
        mp[a][y.first] += y.second;
        if (mp[a][y.first] > t[a]) {
          t[a] = mp[a][y.first];
          sum[a] = 0;
        }
        if (mp[a][y.first] == t[a]) sum[a] += y.first;
      }
      mp[x].clear();
    }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> c[i];
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    veci[a].push_back(b);
    veci[b].push_back(a);
  }
  for (int i = 0; i < n; i++) {
    t[i] = 1;
    sum[i] = c[i];
    mp[i][c[i]] = 1;
    val[i] = 1;
  }
  cout << endl;
  dfs(0, 0);
  for (int i = 0; i < n; i++) cout << sum[i] << " ";
}
