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;
vector<vector<long long> > adj(123456);
long long w[123456], a[123456], b[123456];
long long iinf;
int add(long long &a, long long &b, long long &c) {
  long long val;
  if (iinf / c > abs(b)) {
    val = b * c;
  } else {
    cout << "NO" << endl;
    exit(0);
  }
  a += val;
  if (abs(a) > iinf) {
    cout << "NO" << endl;
    exit(0);
  }
  return 0;
}
int dfs(int cur, int par) {
  int i, flag = 0;
  for (i = 0; i < adj[cur].size(); i++) {
    if (adj[cur][i] != par) {
      dfs(adj[cur][i], cur);
      flag = 1;
    }
  }
  b[cur] -= a[cur];
  if (par == -1) {
    if (b[cur] < 0) {
      cout << "NO" << endl;
    } else {
      cout << "YES" << endl;
    }
    exit(0);
  } else {
    if (b[cur] >= 0) {
      b[par] += b[cur];
    } else {
      add(b[par], b[cur], w[cur]);
    }
  }
  return 0;
}
int main() {
  std::ios::sync_with_stdio(false);
  int n, dep;
  cin >> n;
  iinf = (1000 * 1000 * 1000 + 5);
  iinf *= (1000 * 1000 * 1000 + 5);
  int i;
  for (i = 0; i < n; i++) {
    cin >> b[i];
  }
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (i = 1; i < n; i++) {
    cin >> dep >> w[i];
    dep--;
    adj[dep].push_back(i);
    adj[i].push_back(dep);
  }
  dfs(0, -1);
  return 0;
}
