#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v);
template <typename A, typename B>
ostream &operator<<(ostream &cout, pair<A, B> const &p) {
  return cout << "(" << p.first << ", " << p.second << ")";
}
template <typename A>
ostream &operator<<(ostream &cout, vector<A> const &v) {
  cout << "[";
  for (int i = 0; i < v.size(); i++) {
    if (i) cout << ", ";
    cout << v[i];
  }
  return cout << "]";
}
template <typename A, typename B>
istream &operator>>(istream &cin, pair<A, B> &p) {
  cin >> p.first;
  return cin >> p.second;
}
const long long MAXN = 2e5 + 7;
vector<pair<long long, long long> > adj[MAXN], cur;
long long a[MAXN], ans[MAXN], d[MAXN];
long long n, m;
void dfs(long long v) {
  cur.push_back(make_pair(d[v], v));
  long long lb =
      lower_bound(cur.begin(), cur.end(), make_pair(d[v] - a[v], 0LL)) -
      cur.begin() - 1;
  if (lb >= 0) {
    ans[cur[lb].second]--;
  }
  for (auto &u : adj[v]) {
    d[u.first] = d[v] + u.second;
    dfs(u.first);
    ans[v] += ans[u.first] + 1;
  }
  cur.pop_back();
}
void check() {
  long long u, v, w;
  cin >> n;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 2; i <= n; i++) {
    cin >> u >> w;
    adj[u].push_back(make_pair(i, w));
  }
  dfs(1);
  for (long long i = 1; i <= n; i++) cout << ans[i] << ' ';
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  for (int i = 1; i <= t; i++) {
    check();
  }
  return 0;
}
