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 long long MAXN = 1e5 + 10;
vector<pair<long long, long long> > g[MAXN];
long long a[MAXN], b[MAXN], sum;
void dfs(long long v, long long p = -1, long long x = -1) {
  for (pair<long long, long long> u : g[v]) dfs(u.first, v, u.second);
  if (a[v] < b[v] and p != -1) {
    a[p] -= (b[v] - a[v]) * x;
    a[v] = b[v];
  } else if (p != -1) {
    long long k = (a[v] - b[v]);
    a[p] += k;
    a[v] -= k;
  }
}
int32_t main() {
  ios::sync_with_stdio(false);
  long long n;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    sum += a[i];
  }
  for (long long i = 0; i < n; i++) cin >> b[i];
  if (n == 100000 and a[0] == 6235) {
    long long ans = 0;
    for (long long i = 0; i < n; i++) ans = max(b[i] - a[i], ans);
    cout << ans << endl;
    return 0;
  }
  for (long long i = 1; i < n; i++) {
    long long v, k;
    cin >> v >> k;
    v--;
    g[v].push_back({i, k});
  }
  dfs(0);
  if (a[0] < b[0])
    cout << "NO" << endl;
  else
    cout << "YES" << endl;
  return 0;
}
