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(input())
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]

pred=[0 for i in range(n)]
weight=[0 for i in range(n)]

for i in range(1,n):
    x,y = [int(z) for z in input().split()]
    pred[i]=x-1
    weight[i]=y
    
tot=sum(a)

for i in range(n-1,-1,-1):
    #print(i)
    y=a[i]-b[i]
    if y>0:
        a[pred[i]]+=y
    else:
        b[pred[i]]-=weight[i]*y
    if b[i]>tot:
        print("NO")
        exit(0)
print("YES" if a[0]>=b[0] else "NO")
