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 node {
  long long to, next, w;
} e[100010];
long long n, cnt = 0, x, y, a[100010], head[100010];
double tmp;
void add(long long i) {
  e[++cnt] = {i, head[x], y};
  head[x] = cnt;
}
void dfs(long long u, long long f, long long k) {
  for (long long i = head[u]; i; i = e[i].next) dfs(e[i].to, u, e[i].w);
  if (a[u] >= 0)
    a[f] += a[u];
  else {
    tmp = double(k) * double(a[u]);
    if (!f || tmp < -1000000000007) {
      puts("NO");
      exit(0);
    }
    a[f] += k * a[u];
    if (a[f] < -1000000000007) {
      puts("NO");
      exit(0);
    }
  }
}
int main() {
  cin >> n;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 1; i <= n; i++) {
    cin >> x;
    a[i] -= x;
  }
  for (long long i = 2; i <= n; i++) {
    cin >> x >> y;
    add(i);
  }
  dfs(1, 0, 0);
  puts("YES");
  return 0;
}
