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 N = 2e6 + 5, inf = 1LL << 62;
long long read() {
  long long x = 0, f = 1;
  char ch;
  while (!isdigit(ch = getchar())) (ch == '-') && (f = -f);
  for (x = ch ^ 48; isdigit(ch = getchar());
       x = (x << 3) + (x << 1) + (ch ^ 48))
    ;
  return x * f;
}
template <class T>
T Max(T a, T b) {
  return a > b ? a : b;
}
template <class T>
T Min(T a, T b) {
  return a < b ? a : b;
}
struct Edge {
  long long to, val;
  Edge *nxt;
  Edge(long long to, long long val, Edge *nxt) : to(to), val(val), nxt(nxt) {}
} * head[N];
void add(long long x, long long y, long long z) {
  head[x] = new Edge(y, z, head[x]);
}
long long n, a[N], b[N], f[N];
void dfs(long long x) {
  f[x] = b[x] - a[x];
  for (Edge *i = head[x]; i; i = i->nxt) {
    dfs(i->to);
    if (f[i->to] < 0) {
      if (inf / i->val <= -f[i->to])
        f[x] = -inf;
      else {
        f[x] += f[i->to] * i->val;
        if (f[x] < -inf) f[x] = -inf;
      }
    } else
      f[x] += f[i->to];
  }
}
signed main() {
  n = read();
  for (long long i = 1; i <= n; ++i) b[i] = read();
  for (long long i = 1; i <= n; ++i) a[i] = read();
  for (long long i = 2, fa, val; i <= n; ++i) fa = read(), add(fa, i, read());
  dfs(1);
  puts(f[1] >= 0 ? "YES" : "NO");
  return 0;
}
