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;
long long a[1000001];
bool ok = 1;
long long b[1000001];
long long k[1000001];
vector<int> adj[1000000];
long long need[1000000];
void dfs(int v) {
  need[v] = b[v] - a[v];
  for (auto u : adj[v]) {
    dfs(u);
    if (need[u] > 0) {
      if (100000000000000000LL / need[u] < k[u]) ok = 0;
      need[v] += need[u] * k[u];
      if (need[v] > 100000000000000000LL) ok = 0;
    } else
      need[v] += need[u];
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) cin >> b[i];
  for (int i = 2; i <= n; i++) {
    int p;
    cin >> p >> k[i];
    adj[p].push_back(i);
  }
  dfs(1);
  if (need[1] <= 0 && ok)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
