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>
const int N = 5 * 1e5 + 1;
const int M = 1e6 + 1;
const long long inf = 2 * 1e12;
const int base = 1e9 + 7;
using namespace std;
long long a[N], b[N], out[N], cur[N], n, x[N], k[N];
pair<int, int> pr[N];
queue<int> q;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n; i++) cin >> b[i];
  for (int i = 0; i < n; i++) cur[i] = a[i] - b[i];
  long long y = 1;
  for (int i = 0; i < n; i++) pr[i].first = -1;
  for (int i = 0; i < n - 1; i++) {
    cin >> x[i] >> k[i];
    x[i]--;
    out[x[i]]++;
    pr[y].first = x[i];
    pr[y].second = k[i];
    y++;
  }
  for (int i = 0; i < n; i++)
    if (out[i] == 0) q.push(i);
  while (!q.empty()) {
    long long z = 0;
    long long j = q.front();
    long long o = pr[j].first;
    long long kk = pr[j].second;
    if (o == -1) {
      if (cur[j] >= 0)
        cout << "YES";
      else
        cout << "NO";
      return 0;
    }
    out[o]--;
    if (cur[j] > 0)
      z = cur[j];
    else
      z = 1ll * kk * cur[j];
    cur[o] += z;
    if (out[o] == 0) q.push(o);
    q.pop();
  }
}
