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;
double req[100005], now[100005];
int x[100005], k[100005], n;
inline int read() {
  int x = 0;
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return x;
}
inline long long readll() {
  long long x = 0;
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  while (c >= '0' && c <= '9') x = x * 10ll + c - '0', c = getchar();
  return x;
}
int main() {
  int i;
  n = read();
  for (i = 1; i <= n; i++) now[i] = readll();
  for (i = 1; i <= n; i++) req[i] = readll();
  for (i = 2; i <= n; i++) x[i] = read(), k[i] = read();
  for (i = n; i >= 2; i--) {
    if (now[i] > req[i]) {
      now[x[i]] += (now[i] - req[i]);
    } else {
      now[x[i]] -= (req[i] - now[i]) * k[i];
    }
  }
  if (now[1] + 0.000001 > req[1]) {
    puts("YES");
  } else {
    puts("NO");
  }
  return 0;
}
