#include <fstream>
#include <vector>
#include <iostream>
using namespace std;

int n;
int up[100001];
bool fr[100001];
int radacina;
int rez[100001];

vector<int> a[100001];

void read() {
    int i, x, y;
    ifstream f("cerere.in");
    f >> n;
    for (i = 1; i <= n; i++)
        f >> up[i];
    for (i = 1; i < n; i++) {
        f >> x >> y;
        fr[y] = 1;
        a[x].push_back(y);
        a[y].push_back(x);
    }
    f.close();
}

int st[100001], l;

void dfs(int x, int px) {
    int i;
    rez[x] = 1 + rez[st[l - up[x]]];
    for (i = 0; i < a[x].size(); i++) {
        if (a[x][i] == px) continue;
        st[++l] = a[x][i];
        dfs(a[x][i], x);
        l--;
    }
}

void solve() {
    int i;
    for (i = 1; i <= n; i++)
        if (fr[i] == 0)
            radacina = i;
    l = 1;
    st[l] = radacina;
    dfs(radacina, 0);
}

void output() {
    int i;
    ofstream g("cerere.out");
    for (i = 1; i <= n; i++)
        g << rez[i] - 1 << ' ';
    g.close();
}

int main() {
    read();
    solve();
    output();
    return 0;
}