#include <bits/stdc++.h>
#pragma GCC optimize(2)
#define int long long
using namespace std;
int n, a[300005], w[300005], ans[300005], head[300005], nxt[600005], to[600005], fa[300005], ccnt;
vector<int> v[300005], num[300005];
inline void add(int p, int q) {
	nxt[++ccnt] = head[p];
	to[ccnt] = q;
	head[p] = ccnt;
}
inline int finds(int p) {
	return (fa[p] == p) ? p : (fa[p] = finds(fa[p]));
}
inline void merge(int p, int q) {
	if (p == q) return;
	if (v[p].size() < v[q].size()) swap(p, q);
	for (int j : v[q]) {
		v[p].push_back(j);
		fa[j] = p;
		ans[j] += w[q] - w[p];
	}
	v[q].clear();
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		num[a[i]].push_back(i);
	}
	int p, q;
	for (int i = 1; i < n; i++) {
		cin >> p >> q;
		add(p, q), add(q, p);
	}
	for (int i = 1; i <= n; i++) fa[i] = i, v[i].push_back(i), w[i] = i;
	for (int i = 1; i <= n; i++) {
		for (int j : num[i]) {
			for (int k = head[j]; k; k = nxt[k]) {
				if (a[to[k]] < i) {
					w[finds(to[k])] += j;
				}
			}
		}
		for (int j : num[i]) {
			for (int k = head[j]; k; k = nxt[k]) {
				if (a[to[k]] <= i) {
					merge(finds(j), finds(to[k]));
				}
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		ans[i] += w[finds(i)];
	}
	for (int i = 1; i <= n; i++) {
		cout << ans[i] << " ";
	}
}