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 n, x, y, t;
long long a[110000], h[110000];
struct edge {
  long long y, nxt, w;
} e[110000];
void add(long long i) {
  t++;
  e[t].y = i;
  e[t].nxt = h[x];
  e[t].w = y;
  h[x] = t;
}
void dfs(long long k, long long x, long long s) {
  for (long long i = h[k]; i; i = e[i].nxt) dfs(e[i].y, k, e[i].w);
  if (a[k] >= 0)
    a[x] += a[k];
  else {
    double y = double(s) * double(a[k]);
    if (!x || y < -23333333333333333) {
      puts("NO");
      exit(0);
    }
    a[x] += s * a[k];
    if (a[x] < -23333333333333333) {
      puts("NO");
      exit(0);
    }
  }
}
signed main() {
  cin >> n;
  for (long long i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (long long i = 1; i <= n; i++) scanf("%lld", &x), a[i] -= x;
  for (long long i = 2; i <= n; i++) scanf("%lld%lld", &x, &y), add(i);
  dfs(1, 0, 0);
  puts("YES");
  return 0;
}
