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 maxn = 1e5 + 10;
const int N = 2e5 + 10;
using namespace std;
long long gcd(long long p, long long q) { return q == 0 ? p : gcd(q, p % q); }
long long qmul(long long p, long long q) {
  long long f = 0;
  while (q) {
    if (q & 1) f = f + p;
    if (f > 5e18) return -1;
    p = p + p;
    q >>= 1;
  }
  return f;
}
long long qpow(long long p, long long q, long long mo) {
  long long f = 1;
  while (q) {
    if (q & 1) f = f * p % mo;
    p = p * p % mo;
    q >>= 1;
  }
  return f;
}
int n, m, t, du[maxn], x[maxn], k[maxn];
long long a[maxn], b[maxn];
int main() {
  int i, j;
  scanf("%d", &n);
  for (i = 1; i <= (int)n; i++) scanf("%lld", &b[i]);
  for (i = 1; i <= (int)n; i++) scanf("%lld", &a[i]);
  for (i = 2; i <= (int)n; i++) scanf("%d%d", &x[i], &k[i]), du[x[i]]++;
  queue<int> pq;
  for (i = 1; i <= (int)n; i++)
    if (du[i] == 0) pq.push(i);
  while (!pq.empty()) {
    int p = pq.front();
    pq.pop();
    if (a[p] <= b[p]) {
      b[x[p]] += b[p] - a[p];
    } else {
      if (b[x[p]] - 1.0 * (a[p] - b[p]) * k[p] < -(1LL << 60))
        b[x[p]] = -(1LL << 60);
      else
        b[x[p]] -= (a[p] - b[p]) * k[p];
    }
    if (--du[x[p]] == 0) pq.push(x[p]);
  }
  for (i = 1; i <= (int)n; i++)
    if (a[i] > b[i]) return 0 * puts("NO");
  puts("YES");
  return 0;
}
