#include <fstream>
#include <climits>
#include <vector>
#define DIM 100000
using namespace std;

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

int n, x, y, r;
int K[DIM], Niv[DIM], vis[DIM], G[DIM], parent[DIM];
vector <int> L[DIM];

void dfs(int node, int niv)
{
    vis[node] = 1;
    Niv[niv] = node;
    
    int pas = 0;
    int aux = niv;
    while (K[Niv[aux]] != 0)
    {
        aux -= K[Niv[aux]];
        pas++;
    }
    G[node] = pas;

    for (long unsigned int i = 0; i < L[node].size(); i++)
    {
        int child = L[node][i];
        if (vis[child] == 0)
        {
            dfs(child, 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;
        L[x].push_back(y);
        parent[y] = x;
    }

    for (int i = 1; i <= n; i++)
    {
        if (parent[i] == 0)
        {
            r = i;
            break;
        }
    }

    dfs(r, 1);

    for (int i = 1; i <= n; i++)
    {
        fout << G[i] << " ";
    }
    return 0;
}