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 int a[100100], k[100100];
int v[100100];
void solve(int n) {
  int y, j, i, m, t, p, t1, x, r, q, w;
  long long int z;
  for (i = 0; i < n; i++) scanf("%I64d", &a[i]);
  for (i = 0; i < n; i++) {
    scanf("%I64d", &z);
    a[i] -= z;
  }
  for (i = 1; i < n; i++) {
    scanf("%d%I64d", &v[i], &k[i]);
    v[i]--;
  }
  for (i = n - 1; i >= 1; i--) {
    if (a[i] < -5e17) {
      printf("NO");
      return;
    }
    if (a[i] > 0) {
      a[v[i]] += a[i];
    }
    if (a[i] < 0) {
      if ((1e18) / k[i] < a[i]) {
        printf("NO");
        return;
      }
      a[v[i]] += a[i] * k[i];
    }
  }
  if (a[0] >= 0)
    printf("YES");
  else
    printf("NO");
}
int main() {
#pragma warning(disable : 4996);
  int a, b, n;
  while (scanf("%d", &n) != EOF) {
    solve(n);
    printf("\n");
  }
  return 0;
}
