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>
const int N = 1e5 + 5;
using namespace std;
const long long INF = 1e18;
int n;
long long b[N], a[N];
long long k[N];
struct node {
  int u, v, nxt;
} edge[N];
int head[N], mcnt;
void add_edge(int u, int v) {
  mcnt++;
  edge[mcnt].u = u;
  edge[mcnt].v = v;
  edge[mcnt].nxt = head[u];
  head[u] = mcnt;
}
void dfs(int u, int fa) {
  for (int i = head[u]; i; i = edge[i].nxt) {
    int v = edge[i].v;
    dfs(v, u);
  }
  if (fa == -1) return;
  if (a[u] < b[u])
    b[fa] += b[u] - a[u];
  else if (a[u] > b[u]) {
    double t = 1.0 * k[u] * (a[u] - b[u]);
    if (t > INF) {
      puts("NO");
      exit(0);
    }
    b[fa] -= t;
    if (b[fa] < -INF) {
      puts("NO");
      exit(0);
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &b[i]);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (int i = 2; i <= n; i++) {
    int fa;
    scanf("%d%lld", &fa, &k[i]);
    add_edge(fa, i);
  }
  dfs(1, 0);
  puts(a[1] > b[1] ? "NO" : "YES");
}
