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[100001];
long long b[100001];
vector<pair<long long, long long> > e[100001];
long long f[100001][2];
void dfs(int m) {
  for (int i = 0; i < e[m].size(); i++) {
    dfs(e[m][i].first);
  }
  if (b[m] < a[m]) {
    int c = a[m] - b[m];
    b[m] += c;
    b[f[m][0]] -= c * f[m][1];
  } else {
    int c = b[m] - a[m];
    b[m] -= c;
    b[f[m][0]] += c;
  }
  return;
}
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];
  }
  for (int i = 2; i <= n; i++) {
    int x, k;
    cin >> x >> k;
    e[x].push_back(make_pair(i, k));
    f[i][0] = x;
    f[i][1] = k;
  }
  for (int i = 0; i < e[1].size(); i++) {
    dfs(e[1][i].first);
  }
  if (b[1] >= a[1]) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
  return 0;
}
