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>
#pragma GCC optimize("Ofast")
using namespace std;
long long a[100005], b[100005], p[100005], n;
vector<pair<long long, long long> > v[100005];
void dfs(long long x) {
  for (auto u : v[x]) {
    dfs(u.first);
    if (p[u.first] >= 0)
      p[x] += p[u.first];
    else {
      if (p[u.first] < -1e18 / u.second) {
        cout << "NO";
        exit(0);
      }
      p[x] += p[u.first] * u.second;
    }
    if (p[x] < 1e18) {
      cout << "NO";
      exit(0);
    }
  }
  p[x] += b[x] - a[x];
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (long long i = 1; i <= n; i++) cin >> b[i];
  for (long long i = 1; i <= n; i++) cin >> a[i];
  long long x, y;
  for (long long i = 2; i <= n; i++) {
    cin >> x >> y;
    v[x].emplace_back(make_pair(i, y));
  }
  dfs(1);
  if (p[1] >= 0) {
    cout << "YES";
  } else
    cout << "NO";
  return 0;
}
