#include <fstream>
#include <vector>

#define NMAX 100005

using namespace std;

ifstream f("cerere.in");
ofstream g("cerere.out");

int n, a, b;
bool viz[NMAX], isRoot[NMAX];
int v[NMAX], answer[NMAX], val[NMAX];
vector <int> sons[NMAX];

void DFS(int node, int level) {

    viz[node] = true;
    val[level] = node;
    answer[node] = answer[val[level - v[node]]] + 1;

    for (auto son : sons[node]) {

        if (!viz[son])
            DFS(son, level + 1);
    }
}

int main()
{
    f >> n;
    for (int i = 1; i <= n; i++)
        f >> v[i];
    for (int i = 1; i < n; i++) {
        f >> a >> b;

        sons[a].push_back(b);
        isRoot[b] = true;
    }

    int root = 0;

    for (int i = 1; i <= n; i++) {

        if (!isRoot[i])
            root = i;
    }

    DFS(root, 1);

    for(int i = 1; i <= n; i++) {
        g << answer[i] - 1 << " ";
    }

    return 0;
}