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;
using lli = long long int;
using pii = pair<int, int>;
using vi = vector<int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vlli = vector<long long int>;
using vpii = vector<pair<int, int>>;
lli n, u, v, x, k, ans;
bool pos;
vector<vector<tuple<lli, lli, lli>>> adj;
vlli a, b;
void init() {
  pos = true;
  a.resize(n + 1);
  b.resize(n + 1);
  adj.resize(n + 1);
}
lli dfs(int u, int prev) {
  lli x, v, next, y;
  for (auto t : adj[u]) {
    tie(v, x, y) = t;
    if (v == prev) continue;
    next = dfs(v, u);
    if (next < 0) {
      long double temp = 1.0 * next * x;
      if (temp < -2e17) pos = false;
      a[u] += x * next;
    } else
      a[u] += next / y;
  }
  return a[u] - b[u];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  init();
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) cin >> b[i];
  for (int i = 2; i <= n; i++) {
    cin >> x >> k;
    adj[x].push_back(make_tuple(i, k, 1));
    adj[i].push_back(make_tuple(x, 1, k));
  }
  ans = dfs(1, -1);
  if (ans < 0 || !pos)
    cout << "NO";
  else
    cout << "YES";
}
