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 long long INF = 1e18;
int n;
long long b[100000], a[100000];
vector<pair<int, int> > adj[100000];
long long dfs(int u) {
  long long ret = b[u] - a[u];
  for (auto v : adj[u]) {
    long long res = dfs(v.first);
    if (res < 0) {
      res = -res;
      if (res > INF / v.second)
        ret = -INF;
      else
        ret = ret - res * v.second;
    } else
      ret = ret + res;
  }
  return ret;
}
int main() {
  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]);
  for (int i = 0; i < n - 1; i++) {
    int x;
    long long k;
    scanf("%d %lld", &x, &k);
    int u = x - 1;
    int v = i + 1;
    adj[u].push_back({v, k});
  }
  long long res = dfs(0);
  if (res >= 0)
    puts("YES");
  else
    puts("NO");
  return 0;
}
