#include <fstream>
#include <vector>

#define MAX 100005

using namespace std;

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

vector<int> l[MAX];
int n, m, x, y;
int viz[MAX], k[MAX], sol[MAX], st[MAX], t[MAX];

void dfs(int nod, int niv)
{

    viz[nod] = 1;
    st[niv] = nod;

    sol[nod] = sol[st[niv - k[nod]]] + (k[nod] != 0);

    for (int i = 0; i < l[nod].size(); i++)
    {
        int fiu = l[nod][i];
        if (viz[fiu] == 0)
        {
            dfs(fiu, 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);
        t[y] = x;
    }

    for (int i = 1; i <= n; i++)
    {
        if (t[i] == 0)
        {
            dfs(i, 1);
            break;
        }
    }

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