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 mxn = 1e5 + 5;
const long long inf = 2e17;
long long a[mxn], b[mxn];
vector<pair<int, int> > adj[mxn];
long long val[mxn] = {};
void dfs(int cur) {
  val[cur] = a[cur];
  for (pair<int, int> x : adj[cur]) {
    int u = x.first;
    long long k = x.second;
    dfs(u);
    if (val[u] > 0)
      val[cur] += val[u];
    else {
      if (val[u] < -inf || 1.0 * k * (-val[u]) > inf) {
        cout << "NO" << endl;
        exit(0);
      }
      val[cur] += k * val[u];
    }
  }
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> b[i];
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    a[i] = b[i] - a[i];
  }
  for (int i = 2; i <= n; i++) {
    int x;
    long long k;
    scanf("%d %lld", &x, &k);
    adj[x].push_back({i, k});
  }
  dfs(1);
  if (val[1] >= 0)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
