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;
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
const long long arr = 4 * 1e5;
const long long md = 1e9 + 7;
long long a[arr], b[arr], f[arr];
vector<pair<long long, long long> > vec[arr];
void dfs(long long u) {
  f[u] = b[u] - a[u];
  for (long long i = 0; i < vec[u].size(); i++) {
    dfs(vec[u][i].first);
    if (f[vec[u][i].first] < 0) {
      long long pl = f[vec[u][i].first] * vec[u][i].second;
      if (pl / vec[u][i].second != f[vec[u][i].first]) {
        cout << "NO";
        exit(0);
      }
      if (f[u] < 0 && pl < 0)
        if (max(log10(long double(abs(f[u]))), log10(long double(abs(pl)))) >
            17.5) {
          cout << "NO";
          exit(0);
        }
      f[u] = f[u] + pl;
    } else {
      f[u] += f[vec[u][i].first];
    }
  }
}
signed main() {
  long long n;
  cin >> n;
  for (long long i = 1; i <= n; i++) cin >> b[i];
  for (long long i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 2; i <= n; i++) {
    long long x, k;
    cin >> x >> k;
    vec[x].push_back({i, k});
  }
  dfs(1);
  if (f[1] < 0)
    cout << "NO";
  else
    cout << "YES";
}
