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

ifstream is("cerere.in");
ofstream os("cerere.out");

int n;
vector<vector<int> > g;
vector<int> t, c, k, a;
void Find(int x);

int main()
{
	is >> n;
	t.resize(n + 1);
	k.resize(n + 1);
	g.resize(n + 1);
	c.resize(n + 1);
	a.resize(n + 1);
	for ( int i = 1; i <= n; ++i )
		is >> k[i];
	int x, y;
	for ( int i = 1; i < n; ++i )
	{
		is >> x >> y;
		t[y] = x;
		g[x].push_back(y);
	}
	Find(1);
	for ( int i = 1; i <= n; ++i )
		os << a[i] << ' ';
	
		
	is.close();
	os.close();
	return 0;
}

void Find(int x)
{
	c.push_back(x);
	if ( c.size() != 1 && k[x] )
		a[x] = a[c[c.size() - k[x] - 1]] + 1;
	for ( vector<int>::iterator it = g[x].begin(); it != g[x].end(); ++it )
		Find(*it);
	c.pop_back();
}