#include <fstream>
#include <vector>

using namespace std;

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

const int NMax = 1e5;

vector <int> G[NMax + 5], S;
int N, K[NMax + 5], DP[NMax + 5];

void DFS(int Nod, int Tata)
{
    S.push_back(Nod);
    DP[Nod] = DP[S[S.size() - K[Nod] - 1]] + 1;

    for(auto Vecin : G[Nod])
        if(Vecin != Tata)
            DFS(Vecin, Nod);

    S.pop_back();
}

int main()
{
    fin >> N;

    for(int i = 1; i <= N; i++)
        fin >> K[i], DP[i] = -1;;

    for(int i = 1, a, b; i < N; i++)
    {
        fin >> a >> b;

        G[a].push_back(b);
        G[b].push_back(a);
    }
    DFS(1, 0);

    for(int i = 1; i <= N; i++)
        fout << DP[i] << " ";

    fin.close();
    fout.close();

    return 0;
}