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;
const long long infl = 1e17 + 5;
long long int n, m, q, y, f, val, t = 1, i, j;
long long int ind = -1, cnt, sz, sm, ans, mx = -1, mn = infl;
long long int a[1000004], b[1000004], x[1000004], k[1000004];
int fn(long long int n) {
  if (n == 0) return 0;
  return 1 + fn(n / 10);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  if (fopen("inp.txt", "r")) {
    freopen("myfile.txt", "w", stdout);
    freopen("inp.txt", "r", stdin);
  }
  cin >> n;
  for (i = 1; i < n + 1; i++) {
    cin >> a[i];
  }
  for (i = 1; i < n + 1; i++) {
    cin >> b[i];
  }
  for (i = 2; i < n + 1; i++) {
    cin >> x[i] >> k[i];
  }
  for (i = n; i >= 2; i--) {
    long long int rem = b[i] - a[i];
    if (b[i] >= a[i]) {
      if (rem >= infl / k[i]) {
        f = 1;
        break;
      }
      a[x[i]] -= k[i] * rem;
      if (a[x[i]] < -infl) {
        f = 1;
        break;
      }
    } else {
      a[x[i]] -= rem;
    }
  }
  for (i = 1; i < n; i++)
    if (a[i] < b[i]) f = 1;
  if (f) {
    cout << "NO";
  } else
    cout << "YES";
  return 0;
}
