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[100007], b[100007], x[100007], k[100007];
int main() {
  long long n, m, i, j, y, xx;
  scanf("%I64d", &n);
  for (i = 1; i <= n; i++) scanf("%I64d", &b[i]);
  for (i = 1; i <= n; i++) scanf("%I64d", &a[i]);
  if (n > 1) {
    for (i = 2; i <= n; i++) {
      scanf("%I64d%I64d", &x[i], &k[i]);
    }
  }
  i = n;
  double yy;
  while (i > 1) {
    if (b[i] < a[i]) {
      yy = k[i] * (a[i] - b[i]);
      if (yy > (1 << 18)) {
        b[1] = 1 << 13;
        break;
      }
      b[x[i]] -= k[i] * (a[i] - b[i]);
    } else if (b[i] > a[i]) {
      yy = b[x[i]] + b[i] - a[i];
      if (yy > (1 << 18)) {
        b[1] = 1 << 13;
        break;
      }
      b[x[i]] += b[i] - a[i];
    }
    i--;
  }
  if (b[1] >= a[1])
    printf("YES\n");
  else
    printf("NO\n");
  while (j >= 2) return 0;
}
