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>
struct Edge {
  long long to, dis, next;
} edge[100100];
long long n, num_edge;
long long first1[100100];
long long a[100100], b[100100];
double tem;
void dfs(long long x, long long fa, long long p) {
  long long k = first1[x];
  while (k != 0) {
    dfs(edge[k].to, x, edge[k].dis);
    k = edge[k].next;
  }
  if (a[x] < b[x])
    b[fa] += b[x] - a[x];
  else if (a[x] > b[x]) {
    tem = (double)(b[x] - a[x]) * p;
    if (tem < -110000000000000000) {
      printf("NO");
      exit(0);
    }
    b[fa] -= p * (a[x] - b[x]);
    if (b[fa] < -110000000000000000) {
      printf("NO");
      exit(0);
    }
  }
}
int main() {
  long long i, x, k;
  scanf("%lld", &n);
  for (i = 1; i <= n; i++) scanf("%lld", &b[i]);
  for (i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (i = 2; i <= n; i++) {
    scanf("%lld%lld", &x, &k);
    edge[++num_edge].to = i;
    edge[num_edge].dis = k;
    edge[num_edge].next = first1[x];
    first1[x] = num_edge;
  }
  k = first1[1];
  while (k != 0) {
    dfs(edge[k].to, 1, edge[k].dis);
    k = edge[k].next;
  }
  if (b[1] < a[1])
    printf("NO");
  else
    printf("YES");
  return 0;
}
