#include <fstream>
#include <vector>
#define maxn 100001

using namespace std;

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

vector <int> G[maxn];
int stack[maxn],sol[maxn],k[maxn];
int lvl,n,a,b;

void dfs (int node)
{
    stack[++lvl]=node;
    if (k[node]==0) sol[node]=0;
    else sol[node] = sol [stack[lvl-k[node]]] + 1;

    for (vector<int>::iterator it=G[node].begin(); it!=G[node].end();++it)
        dfs (*it);

    --lvl;
}

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

    for (int i=1; i<n; ++i)
    {
        fin>>a>>b;
        G[a].push_back(b);
    }

    for (int i=1; i<=n; ++i)
       if (k[i]==0) dfs(i);

    for (int i=1; i<=n; ++i) fout<<sol[i]<<" ";
}