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 N = 1e5, inf = 2e9;
int n;
long long a[N], b[N], val[N];
vector<pair<int, int>> g[N];
void dfs(int x, int k) {
  for (auto u : g[x]) {
    int to = u.first, nk = u.second;
    dfs(to, nk);
    a[x] += val[to];
  }
  if (!x) return;
  if (b[x] > a[x]) {
    __int128 want = (__int128)(a[x] - b[x]) * k;
    if (want <= -1e18) {
      puts("NO");
      exit(0);
    }
    val[x] = want;
  } else {
    val[x] += a[x] - b[x];
  }
}
int main() {
  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 i = 0; i < n - 1; ++i) {
    int x, k;
    scanf("%d%d", &x, &k);
    x--;
    g[x].push_back({i + 1, k});
  }
  dfs(0, 0);
  if (a[0] >= b[0])
    puts("YES");
  else
    puts("NO");
}
