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 int M = 1e9 + 7;
const double eps = 1e-10;
const double pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const long long linf = 1e18;
const int N = 1e5 + 10;
struct Edge {
  int to, next, needFrom;
} e[N * 2];
int tot, head[N];
long long supply[N], require[N];
int n;
void init() {
  tot = 0;
  memset(head, -1, sizeof(head));
}
void add(int u, int v, int w) {
  e[tot].to = v;
  e[tot].needFrom = w;
  e[tot].next = head[u];
  head[u] = tot++;
}
void dfs(int u, int pre) {
  for (int i = head[u]; i != -1; i = e[i].next) {
    int v = e[i].to;
    if (v == pre) continue;
    dfs(v, u);
    long long delta = supply[v] - require[v];
    if (delta < 0)
      require[u] -= delta;
    else if (delta > 0)
      supply[u] += delta / e[i].needFrom;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%I64d", &supply[i]);
  for (int i = 0; i < n; i++) scanf("%I64d", &require[i]);
  int x, k;
  init();
  for (int i = 2; i <= n; i++) {
    scanf("%d%d", &x, &k);
    add(x, i, k);
  }
  dfs(1, 0);
  if (supply[1] >= require[1])
    puts("YES");
  else
    puts("NO");
  return 0;
}
