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;
int n;
long long a[100010], b[100010], w[200010], f[100010];
int cnt, head[100010], to[200010], nxt[200010];
void add(int x, int y, int z) {
  cnt++;
  to[cnt] = y;
  nxt[cnt] = head[x];
  head[x] = cnt;
  w[cnt] = z;
}
void dfs(int x) {
  for (int i = head[x]; i; i = nxt[i]) {
    int y = to[i];
    dfs(y);
    if (f[y] > 0) {
      f[x] += f[y];
    } else {
      f[x] += f[y] * w[i];
      f[y] = 0;
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%I64d", &b[i]);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%I64d", &a[i]);
    f[i] = b[i] - a[i];
  }
  for (int i = 2; i <= n; i++) {
    int x, k;
    scanf("%d%d", &x, &k);
    add(x, i, k);
  }
  dfs(1);
  if (f[1] < 0) {
    puts("NO");
  } else {
    puts("YES");
  }
  return 0;
}
