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;
template <typename T>
inline void read(T& x) {
  x = 0;
  T fl = 1;
  char ch = 0;
  for (; ch < '0' || ch > '9'; ch = getchar())
    if (ch == '-') fl = -1;
  for (; ch >= '0' && ch <= '9'; ch = getchar())
    x = (x << 1) + (x << 3) + (ch ^ 48);
  x *= fl;
}
template <typename T, typename... Args>
inline void read(T& x, Args&... args) {
  read(x);
  read(args...);
}
const int N = 1e6 + 5;
struct edge {
  int to, nt;
} E[N];
int H[N], e_cnt, n;
double h[N];
long long k[N], b[N], a[N];
void add_edge(int u, int v) {
  E[++e_cnt] = (edge){v, H[u]};
  H[u] = e_cnt;
}
void dfs(int u) {
  for (int e = H[u]; e; e = E[e].nt) {
    int v = E[e].to;
    dfs(v);
    if (h[v] < 0)
      h[u] += 1.0 * k[v] * h[v];
    else
      h[u] += h[v];
  }
}
int main() {
  read(n);
  for (int i = (1); i <= (n); i++) read(b[i]);
  for (int i = (1); i <= (n); i++) read(a[i]);
  for (int i = (1); i <= (n); i++) h[i] = b[i] - a[i];
  for (int i = (2); i <= (n); i++) {
    int x;
    read(x, k[i]);
    add_edge(x, i);
  }
  dfs(1);
  if (h[1] >= 0)
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}
