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 long long N = 1e5 + 7;
const long long inf = (long long)1e18;
long long a[N], b[N];
vector<pair<long long, long long> > g[N];
bool pos;
void dfs(int s) {
  for (auto nd : g[s]) {
    dfs(nd.first);
    if (a[nd.first] <= b[nd.first])
      b[s] = (b[s] + b[nd.first] - a[nd.first]);
    else {
      if (1.0 * nd.second * (a[nd.first] - b[nd.first]) + 1.0 * a[s] > 1e18)
        pos = false;
      a[s] = (a[s] + nd.second * (a[nd.first] - b[nd.first]));
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cout.precision(15);
  cout.setf(ios::fixed);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> b[i];
  for (int i = 0; i < n; i++) cin >> a[i];
  long long x, k;
  for (int i = 1; i < n; i++) {
    cin >> x >> k;
    x--;
    g[x].push_back({i, k});
  }
  pos = true;
  dfs(0);
  if (a[0] > b[0]) pos = false;
  if (pos)
    cout << "YES" << '\n';
  else
    cout << "NO" << '\n';
}
