#include <bits/stdc++.h>

using namespace std;
vector <int> v[100005], l;
int ct[100005];
int s[100005], fr[100005];
bool viz[100005];
void dfs(int k) {
    viz[k] = 1;

    l.push_back(k);
    ct[k] = ct[l[l.size() - 1 - s[k]]] + 1;
    for (int i = 0; i < v[k].size(); i++) {
        if (viz[v[k][i]] == 0)
            dfs(v[k][i]);
    }
    l.pop_back();
}
int main()
{
    ifstream f("cerere.in");
    ofstream g("cerere.out");
    int n;
    f >> n;

    for (int i = 1; i <= n; i++)
        f >> s[i], ct[i] = -1;
    for (int i = 1; i < n; i++) {
        int x, y;
        f >> x >> y;
        v[x].push_back(y);
        fr[y] ++;

    }
    for (int i = 1; i <= n; i ++) {
        if (fr[i] == 0)dfs(i);
    }

    for (int i = 1; i <= n; i ++)
        g << ct[i] << " ";
    return 0;

}