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

using namespace std;

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

int n, lantLun, r;
int stramos[200100], ans[200100], lant[200100];
bool fr[200100];
vector<vector<int>> adj;

void dfs(int node, int father)
{
    lant[++lantLun] = node;

    if(stramos[node] != 0)
    {
        int indStramos = max(0, lantLun - stramos[node]);
        int str = lant[indStramos];
        ans[node] = ans[str] + 1;
    }

    for(auto it: adj[node])
    {
        if(it == father)
            continue;

        dfs(it, node);
    }

    lantLun--;
}

int main()
{
    in >> n;

    for(int i = 1; i <= n; i++)
    {
        in >> stramos[i];

        if(stramos[i] == 0 && r == 0)
            r = i;
    }

    adj.resize(n + 5);
    for(int i = 1; i < n; i++)
    {
        int x, y;
        in >> x >> y;

        adj[x].push_back(y);
        adj[y].push_back(x);
    }

    //cout << "GOT HERE\n";

    dfs(r, 0);

    for(int i = 1; i <= n; i++)
        out << ans[i] << ' ';

    out << '\n';

    return 0;
}