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>
using namespace std;
double ans[100005];
long long x[100005], k[100005];
int main() {
  int i, n;
  cin >> i;
  for (n = 1; n <= i; n++) cin >> ans[n];
  for (n = 1; n <= i; n++) {
    long long a;
    cin >> a;
    ans[n] = a - ans[n];
  }
  for (n = 2; n <= i; n++) cin >> x[n] >> k[n];
  for (n = i; n > 1; n--) {
    if (ans[n] > 0)
      ans[x[n]] += k[n] * ans[n];
    else
      ans[x[n]] += ans[n];
  }
  if (ans[1] < 0.5)
    cout << "YES";
  else
    cout << "NO";
  cout << endl;
}
