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.util.*;

import java.math.BigInteger;



public class Main {



	public static void main(String[] args) {

		int NN=100100;

		BigInteger a[]=new BigInteger[NN];

		BigInteger b[]=new BigInteger[NN];

		BigInteger k[]=new BigInteger[NN];

		int fa[]=new int[NN];

		

		int n;

		Scanner in=new Scanner(System.in);

		n=in.nextInt();

		

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

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

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

			fa[i]=in.nextInt();

			k[i]=in.nextBigInteger();

		}

		

		BigInteger _inf=BigInteger.TEN.pow(50);

		_inf=BigInteger.ZERO.subtract(_inf);

		

		boolean ok=true;

		for(int i=n; ok && i>=1; i--){

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

			if(i>1){

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

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

				if(b[fa[i]].compareTo(_inf)<0) ok=false;

			}

		}

		

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

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

	}

}


                 