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 ga(int N, int *A) {
  for (int i(0); i < N; i++) scanf("%d", A + i);
}
vector<pair<int, int> > g[100005];
long long A[100005], B[100005];
int N, a, b;
long long dfs(int u) {
  long long S = A[u] - B[u], a;
  for (auto &h : g[u]) {
    a = dfs(h.first);
    if (a >= 0)
      S += a;
    else if (-a * 1. * h.second > 2e17)
      puts("NO"), exit(0);
    else
      S += a * h.second;
    if (S > 2e17) puts("NO"), exit(0);
  }
  return S;
}
int main(void) {
  scanf("%d", &N);
  for (int i(0); i < N; i++) scanf("%lld", A + i);
  for (int i(0); i < N; i++) scanf("%lld", B + i);
  for (int k(1); k < N; k++) scanf("%d%d", &a, &b), g[--a].push_back({k, b});
  puts(dfs(0) >= 0 ? "YES" : "NO");
  return 0;
}
