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>
static const long long INF = 1LL << 61;
static const int MAXN = 1e5 + 4;
int n;
long long a[MAXN], b[MAXN];
std::vector<std::pair<int, int>> e[MAXN];
long long surplus[MAXN];
void dfs(int u) {
  surplus[u] += b[u] - a[u];
  for (auto p : e[u]) {
    dfs(p.first);
    if (surplus[p.first] >= 0) {
      surplus[u] += surplus[p.first];
    } else {
      if (-surplus[p.first] >= (INF - surplus[u]) / p.second)
        surplus[u] = -INF;
      else
        surplus[u] -= -surplus[p.first] * p.second;
    }
    if (surplus[u] == -INF) break;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%I64d", &b[i]);
  for (int i = 0; i < n; ++i) scanf("%I64d", &a[i]);
  for (int i = 1, x, k; i < n; ++i) {
    scanf("%d%d", &x, &k);
    --x;
    e[x].push_back({i, k});
  }
  dfs(0);
  puts(surplus[0] >= 0 ? "YES" : "NO");
  return 0;
}
