5
27468 7465 74275 40573 40155
112071 76270 244461 264202 132397
1 777133331
2 107454154
3 652330694
4 792720519
 5
78188 56310 79021 70050 65217
115040 5149 128449 98357 36580
1 451393770
2 574046602
3 590130784
4 112514248
 7
1 1 1 1 1 1 1
1 3000000000 3000000000 3000000000 1000000000 1000000000 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
 10
2 8 6 1 2 7 6 9 2 8
4 9 4 3 5 2 9 3 7 3
1 8
2 8
3 8
4 10
5 1
6 4
7 3
8 10
9 2
 11
1 1 1 1 1 1 1 1 1 1 1
1 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001 1000000001
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
 5
2 1 1 2 3
1 2 2 2 1
1 2
1 3
2 4
1 4

NO
 NO
 NO
 YES
 NO
 NO

n = int(raw_input())
b = [0] + map(int, raw_input().split())
a = [0] + map(int, raw_input().split())
g = [[] for i in xrange(n + 1)]
for i in xrange(2, n + 1):
    p, k = map(int, raw_input().split())
    g[p].append([i, k])
c = [0 for i in xrange(n + 1)]
for u in xrange(n, 0, -1):
    c[u] = b[u] - a[u]
    for v, k in g[u]:
        if c[v] > 0:
            c[u] += c[v]
        else:
            c[u] += c[v] * k
    if c[u] < -10 ** 18:
        print "NO"
        exit(0)
print "NO" if c[1] < 0 else "YES"