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 MXN = 1e5 + 1;
set<pair<int, int> > adj, g[MXN];
long long N, B[MXN], A[MXN];
int main() {
  cin >> N;
  for (int x = 0, qwe = N; x < qwe; x++) cin >> B[x];
  for (int x = 0, qwe = N; x < qwe; x++) cin >> A[x], A[x] -= B[x];
  for (int x = 1, qwe = N; x < qwe; x++) {
    int xj, kj;
    cin >> xj >> kj;
    xj--;
    g[x].insert({xj, 1});
    g[xj].insert({x, kj});
  }
  for (int x = 0, qwe = N; x < qwe; x++) adj.insert({((int)(g[x]).size()), x});
  while (adj.size() > 1) {
    int u = adj.begin()->second;
    adj.erase(adj.begin());
    int v = g[u].begin()->first;
    g[v].erase(g[v].lower_bound({u, 0}));
    adj.erase({((int)(g[v]).size()) + 1, v});
    adj.insert({((int)(g[v]).size()), v});
    if (A[u] <= 0)
      A[v] += A[u] / g[u].begin()->second;
    else
      A[v] += g[u].begin()->second * A[u];
  }
  bool valid = A[adj.begin()->second] <= 0;
  cout << (valid ? "YES" : "NO") << "\n";
}
