#include <fstream>
#include <vector>
#include <bitset>
using namespace std;

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

const int Max = 1e5 + 1;

vector<int> graph[Max], k(Max), s(Max), ans(Max);
bitset<Max> parent;

void dfs(int node, int h)
{
    s[h] = node;
    if(k[node])
        ans[node] = 1 + ans[s[h - k[node]]];
    for(int i: graph[node])
        dfs(i, h + 1);
}

int main()
{
    int n;
    fin >> n;
    for(int i = 1; i <= n; ++i)
        fin >> k[i];
    for(int i = 1; i < n; ++i)
    {
        int x, y;
        fin >> x >> y;
        graph[x].push_back(y);
        parent[y] = 1;
    }
    for(int i = 1; i <= n; ++i)
        if(!parent[i])
        {
            dfs(i, 0);
            break;
        }
    for(int i = 1; i <= n; ++i)
        fout << ans[i] << " ";

    fin.close();
    fout.close();
    return 0;
}