#include <fstream>
#include <vector>

using namespace std;

ifstream fin("cerere.in");
ofstream fout("cerere.out");

int n, i, k[1000001], a, b, t[1000001], nr[1000001];
vector<int> v[1000001], q;

void dfs(int nod, int niv){
    q.push_back(nod);
    int sol = q[niv-1-k[nod]];
    nr[nod] = nr[sol] + 1;
    for(int i = 0;i<v[nod].size();i++){
        int crt = v[nod][i];
        dfs(crt, niv+1);
    }
    q.pop_back();
}

int main(){
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>k[i];
    for(i=1;i<n;i++){
        fin>>a>>b;
        v[a].push_back(b);
        t[b] = a;
    }
    for(i=1;i<=n;i++)
        nr[i] = -1;

    for(i=1;;i++)
        if(t[i] == 0){
            dfs(i, 1);
            break;
        }
    for(i=1;i<=n;i++)
        fout<<nr[i]<<" ";
    return 0;
}