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 int N = 1e5 + 10;
vector<vector<pair<int, long long int> > > g;
bool possible = true;
long long int a[N], b[N];
void dfs(int v, int p, long long int w) {
  for (auto x : g[v]) {
    int u = x.first;
    long long int w = x.second;
    if (u != p) {
      dfs(u, v, w);
      b[v] += max(b[u] - a[u], 0LL);
      b[u] -= max(b[u] - a[u], 0LL);
    }
  }
  if (p != -1 && b[v] < a[v]) {
    b[v] += max(a[v] - b[p], 0LL);
    b[p] -= max((a[v] - b[p]) * w, 0LL);
  }
  return;
}
int main() {
  int n, x;
  long long int k;
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> b[i];
  for (int i = 1; i <= n; ++i) cin >> a[i];
  g.resize(n + 2);
  for (int i = 2; i <= n; ++i) {
    cin >> x >> k;
    g[x].push_back({i, k});
  }
  dfs(1, -1, 1);
  for (int i = 1; i <= n; ++i) possible &= (b[i] >= a[i]);
  if (possible)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
