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;
auto scan = [] {
  static long long a;
  scanf("%lld", &a);
  return a;
};
vector<long long> g[100000];
long long A[100000], cost[100000], ok = 1;
double R[100000];
void dfs(long long v, long long p = -1) {
  for (long long u : g[v]) dfs(u, v);
  if (~p)
    R[p] += A[v] * (A[v] < 0 ? cost[v] : 1),
        A[p] += A[v] * (A[v] < 0 ? cost[v] : 1);
}
int main() {
  long long n = scan(), x;
  for (long long i = 0; i < n; ++i) A[i] = scan();
  for (long long i = 0; i < n; ++i) A[i] -= scan(), R[i] = A[i];
  for (long long i = 1; i < n; ++i) {
    x = scan() - 1, cost[i] = scan();
    g[x].push_back(i);
  }
  dfs(0);
  puts(A[0] >= 0 && R[0] >= -100 ? "YES" : "NO");
}
