739_B. Alyona and a tree
Alyona has a tree with n vertices. The root of the tree is the vertex 1. In each vertex Alyona wrote an positive integer, in the vertex i she wrote ai. Moreover, the girl wrote a positive integer to every edge of the tree (possibly, different integers on different edges).

Let's define dist(v, u) as the sum of the integers written on the edges of the simple path from v to u.

The vertex v controls the vertex u (v ≠ u) if and only if u is in the subtree of v and dist(v, u) ≤ au.

Alyona wants to settle in some vertex. In order to do this, she wants to know for each vertex v what is the number of vertices u such that v controls u.

Input

The first line contains single integer n (1 ≤ n ≤ 2·105).

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109) — the integers written in the vertices.

The next (n - 1) lines contain two integers each. The i-th of these lines contains integers pi and wi (1 ≤ pi ≤ n, 1 ≤ wi ≤ 109) — the parent of the (i + 1)-th vertex in the tree and the number written on the edge between pi and (i + 1).

It is guaranteed that the given graph is a tree.

Output

Print n integers — the i-th of these numbers should be equal to the number of vertices that the i-th vertex controls.

Examples

Input

5
2 5 1 4 6
1 7
1 1
3 5
3 6


Output

1 0 1 0 0


Input

5
9 7 8 6 5
1 1
2 1
3 1
4 1


Output

4 3 2 1 0

Note

In the example test case the vertex 1 controls the vertex 3, the vertex 3 controls the vertex 5 (note that is doesn't mean the vertex 1 controls the vertex 5).
```python
#!/usr/bin/env python3

import sys
import threading
from bisect import *

#def ri():
#    return map(int, input().split())


def dfs(v, d, c, w):
    d += 1
    dist[d] = w[v] + dist[d-1]
    add[d] = 0
    for i in c[v]:
        dfs(i, d, c, w)
    x = bisect_left(dist, dist[d] - a[v], 0, d)
    add[x-1] -= 1
    add[d-1] += 1 + add[d]
    ans[v] = str(add[d])
    d -= 1

#d = 0
dist = [0] * (2*10**5+3)
add = [0] * (2*10**5+3)
n = int(input())
a = [0] * (n+1)
c = [[] for i in range(n+1)]
w = [0] * (n+1)
ans = [''] * (n+1)

for i, j in enumerate(map(int, input().split())):
    a[i+1] = j

for i in range(2, n+1):
    t1, t2 = map(int, input().split())
    c[t1].append(i)
    w[i] = t2


sys.setrecursionlimit(10**5*3 + 100)
threading.stack_size(10**8 + 10**7)
thread = threading.Thread(target=dfs, args=(1, 0, c, w))
thread.start()

if thread.is_alive():
    thread.join()
print(' '.join(ans))
```