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

import java.math.*;

import java.util.*;



public class Main {

    

    public static void main(String[] args) {

        Scanner in=new Scanner(System.in);

        

        int n=in.nextInt();

        int[] fa=new int[n+1];

        BigInteger[] a=new BigInteger[n+1], k=new BigInteger[n+1], b=new BigInteger[n+1];

        for(int i=1; i<=n; i++) a[i]=in.nextBigInteger();

        for(int i=1; i<=n; i++) b[i]=in.nextBigInteger();

        for(int i=2; i<=n; i++) {

            fa[i]=in.nextInt();

            k[i]=in.nextBigInteger();

        }

        

        BigInteger inf=BigInteger.TEN.pow(20).negate();

        int ok=1;

        for(int i=n; i>0; i--) {

            a[i]=a[i].subtract(b[i]);

            if(i==1) break;

            if(a[i].compareTo(BigInteger.ZERO)>0) a[fa[i]]=a[fa[i]].add(a[i]);

            else a[fa[i]]=a[fa[i]].add(k[i].multiply(a[i]));

            if(a[fa[i]].compareTo(inf)<0) {ok=0; break;}

        }

        if(ok==1 && a[1].compareTo(BigInteger.ZERO)>=0) System.out.println("YES");

        else System.out.println("NO");

    }

}
                             