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;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
const int maxn = 1e5 + 50;
int n, fa[maxn], K[maxn], deep[maxn], id[maxn];
vector<int> G[maxn];
long long a[maxn], b[maxn];
void Dfs(int u, int f = 0) {
  for (auto&& v : G[u]) {
    if (v == f) continue;
    deep[v] = deep[u] + 1;
    Dfs(v, u);
  }
}
int main(int argc, char* argv[]) {
  n = read();
  for (int i = 1; i <= n; ++i) scanf("%I64d", b + i);
  for (int i = 1; i <= n; ++i) scanf("%I64d", a + i);
  for (int i = 2; i <= n; ++i) {
    fa[i] = read(), K[i] = read();
    G[fa[i]].emplace_back(i);
  }
  for (int i = 1; i <= n; ++i) id[i] = i;
  Dfs(1);
  sort(id + 1, id + n + 1,
       [](const int& x, const int& y) { return deep[x] > deep[y]; });
  for (int i = 1; i <= n; ++i) {
    int x = id[i];
    if (b[x] < a[x]) {
      puts("NO");
      return 0;
    }
    if (x == 1) continue;
    b[fa[x]] += (b[x] - a[x]) / K[x];
  }
  puts("YES");
  return 0;
}
