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;
long long a[1000009], b[1000009], x[1000009], k[1000009];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i < n + 1; i++) scanf("%lld", &a[i]);
  for (int i = 1; i < n + 1; i++) scanf("%lld", &b[i]);
  for (int i = 2; i < n + 1; i++) scanf("%lld %lld", &x[i], &k[i]);
  bool f = 1;
  double L = 1e18;
  for (int i = n + 1 - 1; i >= 2; i--) {
    long long p = max(0LL, a[i] - b[i]);
    a[i] -= p;
    a[x[i]] += p;
    p = max(0LL, b[i] - a[i]);
    double q = double(p) * k[i];
    if (q > L)
      f = 0;
    else {
      a[x[i]] -= p * k[i];
      if (a[x[i]] < -L) f = 0;
      a[i] += p;
    }
  }
  f = (a[1] >= b[1]) && f;
  cout << (f ? "YES" : "NO") << endl;
}
