#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void umax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
inline void umin(T &a, T b) {
  if (a > b) a = b;
}
template <class T>
inline T abs(T a) {
  return a > 0 ? a : -a;
}
template <class T>
inline T gcd(T a, T b) {
  return __gcd(a, b);
}
template <class T>
inline T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
long long modpow(long long a, long long n, long long temp) {
  long long res = 1, y = a;
  while (n > 0) {
    if (n & 1) res = (res * y) % temp;
    y = (y * y) % temp;
    n /= 2;
  }
  return res % temp;
}
long long ison(long long mask, long long pos) { return (mask & (1 << pos)); }
long long cbit(long long n) {
  long long k = 0;
  while (n) n &= (n - 1), k++;
  return k;
}
long long nbit(long long n) {
  long long k = 0;
  while (n) n /= 2, k++;
  return k;
}
long long mod = 1e9 + 7;
int sgn(long long x) { return x < 0 ? -1 : !!x; }
const double eps = 1e-7;
const double pi = acos(-1.0);
inline void inc(long long &x, long long y) {
  x += y;
  if (x >= mod) x -= mod;
}
inline void dec(long long &x, long long y) {
  x -= y;
  if (x < 0) x += mod;
}
inline void chmax(long long &x, long long y) {
  if (y > x) x = y;
}
inline void mulm(long long &x, long long y) {
  x *= y;
  if (x >= mod) x -= mod;
}
long long xo(long long i) {
  if ((i & 3) == 0) return i;
  if ((i & 3) == 1) return 1;
  if ((i & 3) == 2) return i + 1;
  return 0;
}
vector<pair<long long, long long> > path;
vector<pair<long long, long long> > adj[200005];
long long a[200005], depth[200005];
long long ans[200005];
void dfs(long long v, long long p) {
  ans[v] = 1;
  long long idx = lower_bound((path).begin(), (path).end(),
                              make_pair(depth[v] - a[v], -1ll)) -
                  path.begin();
  idx--;
  if (idx >= 0) ans[path[idx].second]--;
  path.push_back(make_pair(depth[v], v));
  for (long long i = 0; i < adj[v].size(); i++) {
    long long to = adj[v][i].first;
    if (to == p) continue;
    long long len = adj[v][i].second;
    depth[to] = depth[v] + len;
    dfs(to, v);
    ans[v] += ans[to];
  }
  path.pop_back();
}
int main() {
  long long i, j, k, l, m, n;
  cin >> n;
  for (i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 1; i < n; i++) {
    long long p, w;
    cin >> p >> w;
    adj[i + 1].push_back(make_pair(p, w));
    adj[p].push_back(make_pair(i + 1, w));
  }
  dfs(1, -1);
  for (long long i = 1; i <= n; i++) cout << ans[i] - 1ll << " ";
}
