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

using namespace std;

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

const int NMAX = 100003;

vector<int> g[NMAX];
int tata[NMAX], k[NMAX], s[NMAX], stramos[NMAX];
bool vis[NMAX];
int radacina = 1;

void dfs(int nod, int nivel) {
    vis[nod] = true;
    stramos[nivel] = nod;

    if (k[nod] != 0) {
        s[nod] = s[stramos[nivel - k[nod]]] + 1;
    }

    for (auto fiu : g[nod]) {
        if (!vis[fiu])
            dfs(fiu, nivel + 1);
    }
}

int main() {

    int n;
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> k[i];

    for (int i = 1; i <= n - 1; i++) {
        int x, y;
        fin >> x >> y;

        tata[y] = x;
        g[x].push_back(y);
    }

    while (tata[radacina] != 0) {
        radacina = tata[radacina];
    }

    dfs(radacina, 1);
    for (int i = 1; i <= n; i++) {
        fout << s[i] << ' ';
    }

    return 0;
}