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;
long long a[MAX], b[MAX], k[MAX];
vector<int> adj[MAX];
int parent[MAX];
int n;
void die() {
  puts("NO");
  exit(0);
}
inline bool overflow(long long a, long long b) {
  return a >= (long long)1e18 / b;
}
void dfs(int source) {
  for (auto &each : adj[source]) {
    dfs(each);
  }
  if (b[source] > a[source]) {
    b[parent[source]] += b[source] - a[source];
    b[source] = a[source];
  } else if (source > 1) {
    long long need = a[source] - b[source];
    b[source] = a[source];
    if (overflow(need, k[source])) {
      die();
    }
    b[parent[source]] -= need * k[source];
    if (b[parent[source]] <= (long long)-1e18) {
      die();
    }
  }
}
int main() {
  scanf("%d", &n);
  long long sum_b = 0, sum_a = 0;
  for (int i = int(1); i < int(n + 1); i++) {
    scanf("%lld", b + i);
    sum_b += b[i];
  }
  for (int i = int(1); i < int(n + 1); i++) {
    scanf("%lld", a + i);
    sum_a += a[i];
  }
  if (sum_a > sum_b) {
    puts("NO");
    return 0;
  }
  for (int i = int(2); i < int(n + 1); i++) {
    scanf("%d %lld", parent + i, k + i);
    adj[parent[i]].push_back(i);
  }
  dfs(1);
  bool ok = true;
  for (int i = int(1); i < int(n + 1); i++) {
    if (a[i] > b[i]) {
      ok = false;
    }
  }
  puts(ok ? "YES" : "NO");
  return 0;
}
