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 ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
const int N = 1e5 + 2;
const ll INF = 8e18;
int n, K[N];
ll a[N], b[N], tot;
vector<int> g[N];
void dfs(int u, int p) {
  for (int v : g[u])
    if (v != p) dfs(v, u);
  if (u == 1)
    cout << (b[1] >= a[1] ? "YES" : "NO");
  else {
    if (b[u] < a[u]) {
      if (a[u] - b[u] >= INF / K[u]) {
        cout << "NO\n";
        exit(0);
      }
      b[p] -= (a[u] - b[u]) * K[u];
      b[u] = a[u];
    } else
      b[p] += (b[u] - a[u]);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  for (int i = (1); i <= (n); ++i) cin >> b[i], tot += a[i];
  for (int i = (1); i <= (n); ++i) cin >> a[i];
  for (int i = (2); i <= (n); ++i) {
    int p;
    cin >> p >> K[i];
    g[p].emplace_back(i);
  }
  dfs(1, 0);
  return 0;
}
