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 N = 1e5 + 600;
inline long long read() {
  char ch;
  while ((ch = getchar()) < '0' || ch > '9')
    ;
  long long res = ch - '0';
  while ((ch = getchar()) >= '0' && ch <= '9') res = res * 10ll + ch - '0';
  return res;
}
long long f[N], all, w[N];
struct Edge {
  int nxt, to, dis;
} e[N];
int h[N], e_num;
void add(int from, int to, int dis) {
  e[++e_num] = (Edge){h[from], to, dis};
  h[from] = e_num;
}
bool check(long long val, long long k) {
  return (log(val) + log(k) > log(all));
}
void dfs(int u, int pre) {
  for (int i = h[u]; i; i = e[i].nxt) {
    int v = e[i].to;
    if (v == pre) continue;
    dfs(v, u);
    if (f[v] >= 0)
      f[u] += f[v];
    else {
      if (check(f[v], 1ll * e[i].dis)) {
        printf("NO");
        exit(0);
      }
      f[u] += f[v] * e[i].dis;
    }
  }
  f[u] += w[u];
}
int n;
int main() {
  n = read();
  for (int i = 1; i <= n; i++) w[i] = read();
  for (int i = 1; i <= n; i++) w[i] -= read();
  for (int i = 1; i <= n; i++)
    if (w[i] > 0) all += w[i];
  int k, x;
  for (int i = 2; i <= n; i++) {
    x = read();
    k = read();
    add(x, i, k);
  }
  dfs(1, 0);
  if (f[1] < 0)
    printf("NO");
  else
    printf("YES");
  return 0;
}
