#include <bits/stdc++.h>
#define Nmax 100001
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;
	}
};
class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;
 
    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }
 
 
public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }
 
    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }
 
    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }
 
    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

InParser fin("cerere.in");
OutParser fout("cerere.out");

typedef vector < pair < int, int > > VIP;
typedef vector < int > VI;

const int oo = 1 << 28;

int n, dad, x, y;
int G[Nmax], Ans[Nmax], Arb[Nmax], In[Nmax], dp[Nmax];
VI V[Nmax];

void DFS(int vertex, int lv){
    Arb[lv] = vertex;
    dp[vertex] = dp[Arb[lv - G[vertex]]] + 1;

    for(int new_vertex : V[vertex])
        DFS(new_vertex, lv + 1);
}

int main() {
    fin >> n;

    for(int i = 1; i <= n; ++i)
        fin >> G[i];    

    for(int i = 1; i <= n - 1; ++i){
        fin >> x >> y;

        V[x].push_back(y);
        In[y]++;
    }

    for(int i = 1; i <= n - 1; ++i)
        if(In[i] == 0){
            dad = i;
            break;
        }

    DFS(dad, 1);

    for(int i = 1; i <= n; ++i)
        fout << dp[i] - 1 << ' ' ;

    return 0;   
}