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 = 100000;
long long A[N + 5], B[N + 5], K[N + 5];
int X[N + 5];
vector<int> G[N + 5];
bool vst[N + 5];
long long inf = 1e18;
bool dfs(int s, int p) {
  vst[s] = true;
  for (int u : G[s]) {
    if (vst[u]) continue;
    if (!dfs(u, s)) return false;
  }
  if (s == 1) return B[s] >= A[s];
  if (A[s] > B[s]) {
    if (X[s] == p) {
      long long diff = A[s] - B[s];
      if (1. * diff * K[s] >= inf) return false;
      B[p] -= diff * K[s];
    } else
      B[p] -= A[s] - B[s];
    if (B[p] <= -inf) return false;
    B[s] = A[s];
  } else {
    if (X[p] == s) {
      long long diff = B[s] - A[s];
      diff = diff / K[p] * K[p];
      B[p] += diff / K[p];
      B[s] -= diff;
    } else {
      B[p] += B[s] - A[s];
      B[s] = A[s];
    }
  }
  return true;
}
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("%lld%lld", &X[i], &K[i]);
    G[i].push_back(X[i]);
    G[X[i]].push_back(i);
  }
  puts(dfs(1, -1) ? "YES" : "NO");
  return 0;
}
