#include <iostream>
#include <fstream>
#include <vector>
#define MAX 100002
using namespace std;
int n,k[MAX],t[MAX],st[MAX],ans[MAX],x,y;
vector<int> v[MAX];

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

void dfs(int nod, int tata, int niv){
    st[niv] = nod;
    if(k[nod]){
        ans[nod] = 1+ans[st[niv-k[nod]]];
    }
    for(auto fiu: v[nod]){
        if(fiu == tata){
            continue;
        }
        dfs(fiu, nod, niv+1);
    }
}

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++){
        fin >> k[i];
    }
    for(int i = 1; i < n; i++){
        fin >> x >> y;
        v[x].push_back(y);
        t[y] = x;
    }
    int rad = 0;
    for(int i = 1; i <= n; i++){
        if(t[i] == 0){
            rad = i;
            break;
        }
    }
    dfs(rad, -1, 1);
    for(int i = 1; i <= n; i++){
        fout << ans[i] << " ";
    }
    return 0;
}