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;
struct Edge {
  int to;
  long long int k;
};
int N;
long long int as[114514];
long long int bs[114514];
vector<Edge> es[114514];
long long int sum;
void dfs(int v, int p, long long int k2) {
  long long int k = 0;
  for (Edge &e : es[v]) {
    int u = e.to;
    if (u == p) {
      k = e.k;
      continue;
    }
    dfs(u, v, e.k);
  }
  if (v == p) return;
  if (as[v] > bs[v]) {
    if (as[v] - bs[v] > sum) return;
    long long int req = (as[v] - bs[v]) * k;
    bs[p] -= req;
    bs[v] = as[v];
  } else {
    long long int cnt = (bs[v] - as[v]) / k2;
    bs[p] += cnt;
    bs[v] -= cnt * k2;
  }
}
int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    scanf("%lld", &bs[i]);
    sum += bs[i];
  }
  for (int i = 0; i < N; i++) {
    scanf("%lld", &as[i]);
  }
  for (int i = 1; i < N; i++) {
    int x;
    long long int k;
    scanf("%d%lld", &x, &k);
    --x;
    es[i].emplace_back(Edge{x, k});
    es[x].emplace_back(Edge{i, 1});
  }
  dfs(0, 0, 0);
  for (int i = 0; i < N; i++) {
    if (as[i] > bs[i]) {
      puts("NO");
      return 0;
    }
  }
  puts("YES");
}
