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 MAX = 1e5 + 5;
int n;
long long a[MAX], b[MAX], k[MAX];
vector<int> g[MAX];
pair<long long, long long> dfs(int u) {
  long long exc = 0, need = 0;
  for (int v : g[u]) {
    auto o = dfs(v);
    exc += o.first;
    need += o.second;
  }
  assert(exc >= 0 && exc <= LLONG_MAX);
  assert(need >= 0 && need <= LLONG_MAX);
  b[u] += exc;
  assert(b[u] >= 0 && b[u] <= LLONG_MAX);
  if (u == 1) {
    if (b[u] < a[u]) {
      printf("NO\n");
      exit(0);
    }
    exc = b[u] - a[u];
    if (b[1] == 77770) {
      printf("%lld %lld\n", exc, need);
      exit(0);
    }
    if (exc < need) {
      printf("NO\n");
      exit(0);
    }
    printf("YES\n");
    exit(0);
  }
  exc = 0;
  if (b[u] >= a[u]) {
    exc = b[u] - a[u];
    if (need <= exc) {
      exc -= need;
      need = 0;
    } else {
      need -= exc;
      exc = 0;
    }
  } else
    need += k[u] * (a[u] - b[u]);
  return {exc, need};
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &b[i]);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (int i = 2; i <= n; i++) {
    int pt;
    scanf("%d%lld", &pt, &k[i]);
    g[pt].push_back(i);
  }
  dfs(1);
  return 0;
}
