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 kNmax = 1e5 + 10;
const long long kLimit = 1LL * 1e6 * 1e6;
long long n, a[kNmax], b[kNmax], x[kNmax], k[kNmax];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> b[i];
  }
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (long long i = 2; i <= n; i++) {
    cin >> x[i] >> k[i];
  }
  for (long long i = n; i; i--) {
    if (b[i] < a[i]) {
      if (i == 1 || x[i] == i || k[i] > b[x[i]] / (a[i] - b[i])) {
        cout << "NO";
        return 0;
      }
      b[x[i]] -= k[i] * (a[i] - b[i]);
      b[i] = a[i];
    }
    if (x[i] != i) {
      b[x[i]] = min(kLimit, b[x[i]] + b[i] - a[i]);
    }
  }
  cout << "YES\n";
}
