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 mx = 1e5 + 10;
const long long int oo = 1e18;
vector<int> g[mx];
long long int b[mx], a[mx], k[mx];
int p[mx];
vector<int> lyr[mx];
void dfs(int u, int l = 0) {
  lyr[l].push_back(u);
  for (int v : g[u])
    if (v != p[u]) dfs(v, l + 1);
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lld", b + i);
  for (int i = 0; i < n; i++) scanf("%lld", a + i);
  for (int i = 1; i < n; i++) {
    scanf("%d %lld", p + i, k + i);
    --p[i];
    g[p[i]].push_back(i);
  }
  dfs(0);
  bool ok = true;
  for (int l = n - 1; l > 0 && ok; l--)
    for (int u : lyr[l]) {
      int pu = p[u];
      long long int dx = b[u] - a[u];
      if (dx >= 0)
        b[pu] += dx, b[u] -= dx;
      else {
        dx = -dx;
        if (k[u] <= oo / dx) {
          b[u] += dx;
          b[pu] -= k[u] * dx;
          if (b[pu] <= -oo) ok = false;
        } else
          ok = false;
      }
    }
  if (b[0] < a[0]) ok = false;
  if (ok)
    puts("YES");
  else
    puts("NO");
  return 0;
}
