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 hehe {
  int to, next;
  long long k;
} e[100005];
int n;
long long a[100005], b[100005];
int cnt = 0, h[100005] = {0};
long long x[100005], k[100005];
void add(int x, int y, long long z) {
  cnt++;
  e[cnt].to = y;
  e[cnt].k = z;
  e[cnt].next = h[x];
  h[x] = cnt;
}
int dfs(int x) {
  long long sum = 0;
  for (int i = h[x]; i; i = e[i].next) {
    int y = e[i].to;
    long long num = dfs(y);
    if (num >= 0)
      sum += num;
    else
      sum += e[i].k * num;
  }
  sum += b[x] - a[x];
  return sum;
}
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]);
  for (int i = 2; i <= n; i++) {
    scanf("%d%d", &x[i], &k[i]);
    add(x[i], i, k[i]);
  }
  if (dfs(1) >= 0)
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}
