#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
 
void dfs(int nod,int *a, vector<vector<int>> v,vector<int> stiva,int *rez)
{
    // 1 -> 2 -> 3 -> 4
    // 0    1    1    1
    if (a[nod - 1] == 0) {
        rez[nod - 1] = 0;
    } else {
        rez[nod-1] = rez[stiva[stiva.size() - a[n-1]]] + 1;
    }
    stiva.push_back(nod);
    for (int i = 0; i < v[nod].size(); i++)
    {
        dfs(v[nod][i],a,v,stiva,rez);
    }
}
 
int main()
{
    ifstream in("cerere.in");
    ofstream out("cerere.out");
    int n;
    in >> n;
    int a[n],maimute[n] = {0},m,rez[n];
    vector <vector<int>> v(n+1);
    for (int i = 0; i < n; i++)
    {
        in >> a[i];
    }
    for (int i = 0; i < n-1; i++)
    {
        int aux1,aux2;
        in >> aux1 >> aux2;
        maimute[aux2-1]++;
        v[aux1].push_back(aux2);
    }
    for (int i = 0; i < n; i++)
    {
        if (maimute[i] == 0)
        {
            m = i + 1;
        }
        
    }
    vector<int> stiva;
    dfs(m,a,v,stiva,rez);
 
    for (int i = 0; i < n; i++)
    {
        out << rez[i] << " ";
    }
    
 
    in.close();
    out.close();
    return 0;
}