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;
constexpr int N = 2e5;
long long n, d[N], have[N], a[N], x, val, v, cnt, h;
queue<int> leaf;
vector<int> node[N];
map<long long, long long> w[N];
bool check() { return cnt < h; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> have[i];
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 2; i <= n; i++) {
    cin >> x >> val;
    node[x].push_back(i);
    w[x][i] = val;
    node[i].push_back(x);
    w[i][x] = 1;
    d[x]++;
    d[i]++;
  }
  for (int i = 1; i <= n; i++) {
    cnt += have[i];
    h += a[i];
    if (d[i] == 1) leaf.push(i);
  }
  while (leaf.size()) {
    if (check()) {
      cout << "NO" << '\n';
      return 0;
    }
    v = leaf.front();
    d[v]--;
    for (auto i : node[v])
      if (d[i]) {
        if (have[v] <= a[v]) {
          have[i] -= (a[v] - have[v]) * w[i][v];
          cnt += a[v] - have[v];
          cnt -= (a[v] - have[v]) * w[i][v];
        } else {
          have[i] += (have[v] - a[v]) * w[v][i];
          cnt += (have[v] - a[v]) * w[v][i];
          cnt -= have[v] - a[v];
        }
        if (check()) {
          cout << "NO" << '\n';
          return 0;
        }
        have[v] = a[v];
        d[i]--;
        if (d[i] == 1) leaf.push(i);
      }
    leaf.pop();
  }
  for (int i = 1; i <= n; i++) {
    if (have[i] < a[i]) {
      cout << "NO" << '\n';
      return 0;
    }
  }
  cout << "YES" << '\n';
  return 0;
}
