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;
struct RR {
  long long to, k, nex;
} r[211111];
int hea[111111] = {0}, cnt = 0;
long long n, a[111111], t;
double tem;
void R(long long &x) { scanf("%I64d", &x); }
void dfs(int x, int f, long long kk) {
  int y;
  for (int i = hea[x]; i > 0; i = r[i].nex) {
    y = r[i].to;
    dfs(y, x, r[i].k);
  }
  if (a[x] >= 0) {
    a[f] += a[x];
  } else {
    if (f != 0) {
      tem = (double)a[x] * kk;
      if (tem < -110000000000000000) {
        printf("NO\n");
        exit(0);
      }
      a[f] += a[x] * kk;
      if (a[f] < -110000000000000000) {
        printf("NO\n");
        exit(0);
      }
    } else {
      if (a[x] < 0) {
        printf("NO\n");
        exit(0);
      }
    }
  }
}
int main() {
  R(n);
  for (int i = 1; i <= n; i++) R(a[i]);
  for (int i = 1; i <= n; i++) {
    R(t);
    a[i] -= t;
  }
  long long x, y;
  for (int i = 2; i <= n; i++) {
    R(x);
    R(y);
    r[++cnt] = (RR){i, y, hea[x]};
    hea[x] = cnt;
  }
  dfs(1, 0, 0);
  printf("YES\n");
}
