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 + 5;
long long a[N], b[N];
vector<vector<pair<int, long long>>> v;
long long dfs(int u) {
  long long ret = 0;
  for (auto i : v[u]) {
    long long need = dfs(i.first);
    if (need < 0 && log(b[u]) + fabs(log(need)) + log(i.second) > 1e18) {
      cout << "NO" << endl;
      exit(0);
    }
    if (need > 0 && log(b[u]) + log(need) > log(1e18)) {
      cout << "NO" << endl;
      exit(0);
    }
    if (need < 0)
      b[u] += need * i.second;
    else
      b[u] += need;
    if (b[u] < -2e17) {
      cout << "NO" << endl;
      exit(0);
    }
  }
  return b[u] - a[u];
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lld", b + i);
  for (int i = 0; i < n; i++) scanf("%lld", a + i);
  v.resize(n);
  for (int i = 1; i < n; i++) {
    int a;
    long long b;
    scanf("%d%lld", &a, &b);
    v[--a].push_back({i, b});
  }
  dfs(0);
  puts(b[0] >= a[0] ? "YES" : "NO");
}
