#include<algorithm>
#include<algorithm>
#include<algorithm>
#include<iostream>
#include<map>
#include<string>
#include<string.h>
#include<utility>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<math.h>
#include<vector>
#include<set>
#include<queue>
#include<unordered_map>
#include <random>
using namespace std;
#define endl '\n';
typedef long long ll;
typedef double db;
ll n, k;
ll a[200005];
ll head[200005];
ll fa[200005][50];//i点向上跳2^j的节点
ll dist[200005][50];//2^j的节点的距离
struct node
{
	ll u, v, next;
	ll w;
}edge[200005];
ll d[200500];
ll cnt;
void add(ll u, ll v, ll w)
{
	edge[cnt].u = u;
	edge[cnt].v = v;
	edge[cnt].w = w;
	edge[cnt].next = head[u];
	head[u] = cnt++;
}
void dfs(ll u, ll f)
{
	for (int i = head[u]; i + 1; i = edge[i].next)
	{
		ll v = edge[i].v;
		if (v == f)continue;
		fa[v][0] = u;
		dist[v][0] = edge[i].w;
		for (int j = 1; j <= 48; j++)
		{
			fa[v][j] = fa[fa[v][j - 1]][j - 1];
			dist[v][j] = dist[fa[v][j - 1]][j - 1] + dist[v][j - 1];
		}
		dfs(v, u);
	}
}
ll mic[55];
ll ans[200005];
void find_ans(ll u, ll fa)
{
	ans[u] = d[u];
	for (int i = head[u]; i + 1; i = edge[i].next)
	{
		ll v = edge[i].v;
		if (v == fa)continue;
		find_ans(v, u);
		ans[u] += ans[v];
	}
}
int main()
{

	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	ll n;
	cin >> n;
	memset(fa, -1, sizeof(fa));
	memset(head, -1, sizeof(head));
	mic[0] = 1;
	for (int i = 1; i <= 50; i++)mic[i] = mic[i - 1] * 2;
	for (int i = 1; i <= n; i++)cin >> a[i];
	for (int i = 2; i <= n; i++)
	{
		ll f, w;
		cin >> f >> w;
		add(f, i, w);
	}
	dfs(1, 0);
	for (int i = 2; i <= n; i++)
	{
		ll x = a[i];
		ll u = i;
		for (int i = 48; i >= 0; i--)
		{
			if (dist[u][i]&&x >= dist[u][i] && fa[u][i] != -1)
			{
				x -= dist[u][i];
				u = fa[u][i];
			}
		}
		//	cout << i << " " << u << " " << endl;
		if (i == u)continue;
		d[fa[u][0]]--;
		d[fa[i][0]]++;
	}
	/*for (int i = 1; i <= n; i++)
	{
		///cout << i << " " << d[i] << endl;
	}*/
	find_ans(1, -1);
	for (int i = 1; i <= n; i++)cout << ans[i] << " ";
}