#include <iostream>
#include <vector>
#include <fstream>
#include <bitset>
#include <stdio.h>
#include <ctype.h>

using namespace std;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

const int N=100005;
vector<int> a[N+1];
int stram[N+1];
int stramos[N+1];
int rezultat[N+1];
int cnt=0;
bitset<N+1>dif_radacina;

void parcurgere(int x){
    stram[cnt]=x;
    if(stramos[x]!=0){
        int str=stram[cnt-stramos[x]];
        rezultat[x]=rezultat[str]+1;
    }
    cnt++;
    for(auto y:a[x]){
        parcurgere(y);
    }
    cnt--;
}

int main() {
    //ios_base::sync_with_stdio(false);
    InParser in("cerere.in");
    ofstream out("cerere.out");
    int n;
    in>>n;
    for(int i=1;i<=n;i++){
        in>>stramos[i];
    }
    int x,y;
    for(int i=1;i<n;i++){
        in>>x>>y;
        a[x].push_back(y);
        dif_radacina[y]=true;
    }
    int radacina;
    for(int i=1;i<=n;i++){
        if(!dif_radacina[i])
            radacina=i;
    }
    parcurgere(radacina);
    for(int i=1;i<=n;i++){
        out<<rezultat[i]<<" ";
    }
    return 0;
}