#include <iostream>
#include <fstream>
#include <vector>

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

const int LMAX =  100005;
vector <int> L[LMAX];
vector <int> dist;
bool hasfather[LMAX], viz[LMAX];
int k[LMAX], i, g[LMAX];

void dfs(int node) {
    viz[node] = true;
    for (int vec : L[node]) {
        if (!viz[vec]) { ///daca nu l am vizitat
            if (k[vec] == 0) {
                g[vec] = 0;
                dist.push_back(0);
            }
            else {
                g[vec] = dist[dist.size() - k[vec]]+1;
                dist.push_back(dist[dist.size() - k[vec]]+1);
            }
            dfs(vec);
            dist.pop_back();
        }
    }

}

int main()
{
    int n, node;
    fin>>n;
    for (i = 1; i <= n; i++) {
        fin>>k[i];
    }
    for (i = 0; i < n-1; i++) {
        int x,y;
        fin>>x>>y;
        hasfather[y] = true;
        L[x].push_back(y);
    }
    /*for (i = 1; i <= n; i++) {
        fout<<i<<"--";
        for (int vec : L[i]) {
            fout<<vec<<" ";
        }
        fout<<endl;
    }*/
    node = 1; ///nodul tata
    while (node <= n && hasfather[node]) {
        node++;
    }
    dist.push_back(0);
    g[node] = 0;
    dfs(node);
    for (i = 1; i <= n; i++) {
        fout<<g[i]<<" ";
    }

    return 0;
}