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 maxn = 1e5 + 7;
long long cur[maxn];
long long to[maxn];
vector<pair<int, long long> > g[maxn];
int ind[maxn];
queue<int> q;
inline bool prod(long long x, long long y) {
  if (x == 0 || y == 0) return false;
  if (y > 1000000000000000000ll / x) return true;
  return false;
}
int main() {
  int n;
  scanf("%d", &n);
  fill(ind, ind + n + 1, 0);
  for (int i = 1; i <= n; i++) scanf("%lld", &cur[i]);
  for (int j = 1; j <= n; j++) scanf("%lld", &to[j]);
  for (int i = 2; i <= n; i++) {
    int x;
    long long k;
    scanf("%d", &x);
    scanf("%lld", &k);
    g[i].push_back(make_pair(x, k));
    ind[x]++;
  }
  q = *new queue<int>();
  for (int i = 1; i <= n; i++) {
    if (ind[i] == 0) q.push(i);
  }
  while (q.size() > 0) {
    int v = q.front();
    q.pop();
    for (int j = 0; j < g[v].size(); j++) {
      int z = g[v][j].first;
      long long k = g[v][j].second;
      ind[z]--;
      if (ind[z] == 0) q.push(z);
      if (cur[v] > to[v]) {
        cur[z] += cur[v] - to[v];
        cur[v] = to[v];
      } else {
        if (prod(k, to[v] - cur[v])) {
          printf("NO\n");
          return 0;
        }
        cur[z] -= k * (to[v] - cur[v]);
        cur[v] = to[v];
      }
    }
    if (cur[v] < to[v]) {
      printf("NO\n");
      return 0;
    }
  }
  printf("YES\n");
}
