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 oo = 1e17 + 10;
long long mul(long long a, long long b) {
  if ((double)a * (double)b > oo) return oo;
  return a * b;
}
long long sum(long long a, long long b) {
  if ((double)a + (double)b > oo) return oo;
  return a + b;
}
const int N = 100010;
int deg[N];
long long extra[N], need[N], b[N], a[N];
int x[N], k[N];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", b + i);
  for (int i = 1; i <= n; i++) scanf("%lld", a + i);
  for (int i = 2; i <= n; i++) scanf("%d %d", x + i, k + i);
  for (int i = n; i >= 1; i--) {
    if (b[i] < a[i])
      need[i] += a[i] - b[i];
    else
      extra[i] += b[i] - a[i];
    if (need[i] <= extra[i]) {
      extra[i] -= need[i];
      need[i] = 0;
    } else {
      need[i] -= extra[i];
      extra[i] = 0;
    }
    if (i > 1) {
      if (extra[i]) {
        extra[x[i]] += extra[i];
        extra[i] = 0;
      } else {
        need[x[i]] = sum(need[x[i]], mul(need[i], k[i]));
        need[i] = 0;
      }
    }
  }
  printf("%s\n", need[1] ? "NO" : "YES");
  return 0;
}
