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;
vector<long long> disc;
const long long inf = 1e18;
struct edge {
  int to;
  long long cost;
};
vector<vector<edge> > g;
bool ok = true;
void dfs(int v) {
  for (edge& e : g[v]) {
    dfs(e.to);
    if (!ok) {
      return;
    }
    if (disc[e.to] > 0) {
      disc[v] += disc[e.to];
      disc[e.to] = 0;
    }
  }
  for (edge& e : g[v]) {
    if (disc[e.to] < 0) {
      long long d = -disc[e.to];
      if (e.cost >= (disc[v] + inf + d - 1) / d) {
        ok = false;
        break;
      }
      disc[v] -= d * e.cost;
    }
  }
  if (v == 0 && disc[v] < 0) {
    ok = false;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  disc.resize(n);
  for (int i = 0; i < n; ++i) {
    cin >> disc[i];
  }
  for (int i = 0; i < n; ++i) {
    long long val;
    cin >> val;
    disc[i] -= val;
  }
  g.resize(n);
  for (int i = 1; i < n; ++i) {
    int p;
    cin >> p;
    --p;
    long long cost;
    cin >> cost;
    g[p].push_back({i, cost});
  }
  ok = true;
  dfs(0);
  cout << (ok ? "YES\n" : "NO\n");
}
