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;
void add(long long &a, long long b) {
  if (a == 1e18) return;
  a += b;
  if (a > 1e18) a = 1e18;
}
long long mult(long long a, long long b) {
  if (a == 1e18) return 1e18;
  if (1e18 / b < a) return 1e18;
  a *= b;
  if (a > 1e18) return 1e18;
  return a;
}
int n;
long long b[100010], a[100010];
int par[100010], k[100010];
vector<int> ch[100010];
long long need[100010], excess[100010];
void dfs(int u) {
  for (int v : ch[u]) {
    dfs(v);
    excess[u] += excess[v];
    add(need[u], mult(need[v], k[v]));
  }
  if (b[u] < a[u]) {
    add(need[u], a[u] - b[u]);
  } else {
    excess[u] += b[u] - a[u];
  }
  long long amt = min(need[u], excess[u]);
  add(need[u], -amt);
  excess[u] -= amt;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> b[i];
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 2; i <= n; i++) {
    cin >> par[i] >> k[i];
    ch[par[i]].push_back(i);
  }
  dfs(1);
  cout << (need[1] == 0 ? "YES" : "NO") << '\n';
}
