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 nn = 1e5 + 8;
const long long Max = 1e18;
vector<pair<int, long long> > G[nn];
long long a[nn], b[nn];
long long r[nn], d[nn];
int n;
bool ok = true;
void dfs(int u) {
  for (auto e : G[u]) {
    int v = e.first;
    long long w = e.second;
    dfs(v);
    if (!ok) return;
  }
  long long reqChild = 0;
  for (auto e : G[u]) {
    b[u] += d[e.first];
  }
  long long c = max(0ll, b[u] - a[u]);
  r[u] = max(0ll, a[u] - b[u]);
  for (auto e : G[u]) {
    if (Max - reqChild / e.second < r[e.first]) {
      ok = false;
      return;
    }
    reqChild += r[e.first] * e.second;
  }
  r[u] += reqChild - min(c, reqChild);
  d[u] += max(0ll, c - reqChild);
  if (u == 1) {
    if (r[u] > 0) {
      ok = false;
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> b[i];
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 2; i <= n; i++) {
    int x, y;
    cin >> x >> y;
    G[x].push_back({i, y});
  }
  dfs(1);
  if (ok)
    cout << "YES";
  else
    cout << "NO";
}
