#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("cerere.in");
ofstream cout ("cerere.out");
const int N = 100000;
int help[N+1],n,timp[N+1];
vector <int> L[N+1];
vector <int> coada;
int subord[N+1];
void afisare()
{
    for (int i : coada)
        cout << i << ' ';
    cout << endl;
}
void dfs(int x)
{
    coada.push_back(x);
    if (help[x] == 0)
        timp[x] = 0;
    else if (coada.size()-1 >= help[x])
    {
        timp[x] = timp[coada[coada.size()-1-help[x]]] + 1;
    }
    for (int y : L[x])
    {
        dfs(y);
    }
    coada.pop_back();
}
int main()
{
    int x,y,inteleptu(1);
    cin >> n;
    for (int i=1; i<=n; i++)
        cin >> help[i];
    for (int i=1; i<n; i++)
    {
        cin >> x >> y;
        L[x].push_back(y);
        subord[y] = x;
    }
    while (subord[inteleptu])
    {
        inteleptu = subord[inteleptu];
    }
    dfs(inteleptu);
    for (int i=1; i<=n; i++)
        cout << timp[i] << ' ';
}