#include <bits/stdc++.h>
using namespace std;
const long long int M = 1000000007;
vector<int> adj[100001];
map<int, int> mp[100001];
int arr[100001];
long long int ans[100001];
long long int mx[100001];
int n;
void dfs(int cur, int par) {
  mp[cur][arr[cur]]++;
  for (auto first : adj[cur])
    if (first != par) {
      dfs(first, cur);
      if (mp[cur].size() < mp[first].size()) {
        swap(mp[cur], mp[first]);
        ans[cur] = ans[first];
        mx[cur] = mx[first];
      }
      for (auto n : mp[first]) {
        mp[cur][n.first] += n.second;
        if (mx[cur] < mp[cur][n.first] and n.first != arr[cur]) {
          ans[cur] = n.first;
          mx[cur] = mp[cur][n.first];
        } else if (mx[cur] == mp[cur][n.first] and n.first != arr[cur])
          ans[cur] += n.first;
      }
      mp[first].clear();
    }
  if (mx[cur] < mp[cur][arr[cur]]) {
    ans[cur] = arr[cur];
    mx[cur] = mp[cur][arr[cur]];
  } else if (mx[cur] == mp[cur][arr[cur]])
    ans[cur] += arr[cur];
  if (mx[cur] == -1) ans[cur] = arr[cur];
}
void solve() {
  for (int i = 0; i < 100001; i++) mx[i] = -1;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> arr[i];
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  dfs(1, 0);
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  cout << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t = 1;
  while (t--) solve();
}
