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 int N = 1e5 + 100;
vector<long long int> g[N];
long long long long int par[N];
long long long long int a[N];
long long long long int b[N];
long long long long int dfs(long long long long int v,
                            long long long long int p) {
  for (long long int i = 0; i < g[v].size(); i++) {
    long long long long int u = g[v][i];
    if (u != p) {
      dfs(u, v);
    }
  }
  for (long long int i = 0; i < g[v].size(); i++) {
    long long long long int u = g[v][i];
    if (u != p) {
      if (a[u] < b[u]) {
        a[v] -= b[u] - a[u];
        a[u] = b[u];
      }
    }
  }
  if (v == 1) {
    return 0;
  }
  if (a[v] > b[v]) {
    long long long long int z = a[v] - b[v];
    z /= par[v];
    a[p] += z;
    a[v] -= z * par[v];
  }
}
int32_t main() {
  long long long long int n;
  cin >> n;
  for (long long int i = 1; i <= n; i++) {
    cin >> b[i];
  }
  for (long long int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (long long int i = 2; i <= n; i++) {
    long long long long int u, k;
    cin >> u >> k;
    g[u].push_back(i);
    par[i] = k;
  }
  dfs(1, -1);
  if (a[1] >= b[1]) {
    cout << "YES";
  } else {
    cout << "NO";
  }
}
