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;
template <typename T>
inline void read(T& x) {
  x = 0;
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  while (c >= '0' && c <= '9') {
    x *= 10;
    x += c - '0';
    c = getchar();
  }
}
inline void reads(string& s) {
  char c = getchar();
  while (c < 'a' || c > 'z') c = getchar();
  while (c >= 'a' && c <= 'z') {
    s += c;
    c = getchar();
  }
}
const int N = 100100;
const long long MX = 2e17;
vector<pair<int, int>> g[N];
pair<int, int> pr[N];
long long b[N], a[N];
int n;
void out(int x) {
  if (x == 0) {
    cout << "NO" << endl;
    exit(0);
  }
  if (x == 1) {
    cout << "YES" << endl;
    exit(0);
  }
}
long long dfs(int v) {
  long long add = 0;
  for (auto to : g[v]) {
    if (to.first == pr[v].first) continue;
    add += dfs(to.first);
    if (add <= -MX) out(0);
  }
  b[v] += add;
  if (pr[v].first == 0 && b[v] < a[v]) out(0);
  if (b[v] < a[v]) {
    long long need = (a[v] - b[v]) * pr[v].second;
    add -= need;
  } else {
    add += (b[v] - a[v]);
  }
  return add;
}
int main() {
  ios_base::sync_with_stdio(0);
  read(n);
  for (int i = 0; i < n; i++) read(b[i + 1]);
  for (int i = 0; i < n; i++) read(a[i + 1]);
  for (int i = 2; i <= n; i++) {
    int x, k;
    read(x);
    read(k);
    pr[i] = {x, k};
    g[x].push_back({i, k});
  }
  for (int i = 1; i <= n; i++) {
    if (pr[i].first == 0) {
      dfs(i);
    }
  }
  out(1);
  return 0;
}
