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;
const long long inf = 1e17 + 7;
const int N = 200010;
int n, a[N], b[N];
long long f[N];
struct Edge {
  int to, nxt;
  long long val;
} edge[N << 1];
int head[N << 1], tot;
void add_edge(int x, int y, int z) {
  edge[++tot].to = y;
  edge[tot].val = z;
  edge[tot].nxt = head[x];
  head[x] = tot;
}
void dfs(int u) {
  f[u] = b[u] - a[u];
  for (int i = head[u]; i; i = edge[i].nxt) {
    int v = edge[i].to;
    dfs(v);
    if (f[v] < 0) {
      if (inf / edge[i].val <= -f[v])
        f[u] = -inf;
      else {
        f[u] += f[v] * edge[i].val;
        f[u] = max(f[u], -inf);
      }
    } else
      f[u] += f[v];
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  for (int i = 2; i <= n; i++) {
    int x;
    long long k;
    scanf("%d %lld", &x, &k);
    add_edge(x, i, k);
  }
  dfs(1);
  if (f[1] >= 0)
    printf("YES");
  else
    printf("NO");
  return 0;
}
