#include <fstream>
#include <vector>
using namespace std;
ifstream fin("cerere.in");
ofstream fout("cerere.out");
vector<int> vecini[100005];
int stramosi[100005];
int rasp[100005];
bool e_fiu[100005];
vector<int> lant_curent;
void dfs(int nod, int nivel){
    if (stramosi[nod] == 0)
        rasp[nod] = 0;
    else {
        int stramos = lant_curent[nivel - stramosi[nod] - 1];
        rasp[nod] = rasp[stramos] + 1;
    }
    for (int vecin: vecini[nod]){
        lant_curent.push_back(vecin);
        dfs(vecin, nivel + 1);
        lant_curent.pop_back();
    }
}
int main(){
    int n;
    fin >> n;
    for (int i = 1; i <= n; i++){
        fin >> stramosi[i];
    }
    for (int i = 1; i < n; i++){
        int x, y;
        fin >> x >> y;
        e_fiu[y] = true;
        vecini[x].push_back(y);
    }
    int radacina;
    for (int i = 1; i <= n; i++){
        if (!e_fiu[i]) {
            radacina = i;
            break;
        }
    }
    rasp[radacina] = 0;
    lant_curent.push_back(radacina);
    dfs(radacina, 1);
    for (int i = 1; i <= n; i++){
        fout << rasp[i] << " ";
    }
    return 0;
}