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

#include <bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
#define PB push_back
#define MP make_pair

using namespace std;

int main() {
   ll n;
   cin>>n;
   ll a[n+1],b[n+1];
   for(ll i=0;i<n;i++)cin>>b[i+1];
   for(ll i=0;i<n;i++)cin>>a[i+1];
   
   ll cur[n+1]={0};
   ll go[n+1][2];
   for(ll za=2;za<=n;za++){
 	cin>>go[za][0];
   	cin>>go[za][1];
   }
   for(ll i=n;i>=1;i--){
   	cur[i]+=(b[i]-a[i]);
    if(i==1)break;
   	if(cur[i]>=0){cur[go[i][0]]+=cur[i];    }
    else        {  if(-cur[i]*go[i][1]>1e18){cout<<"NO"<<endl;return 0;}        cur[go[i][0]]+=cur[i]*go[i][1]; }
    cur[i]=0;
    
    
    
    
    
    
    
    
    
    
    
    
    
   }

   	if(cur[1]<0){cout<<"NO"<<endl;return 0;}
                           
   cout<<"YES"<<endl;





	// your code goes here
	return 0;
}