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 MAXN = 100005;
const long long INF = (1LL << 60) - 1;
vector<pair<int, int> > e[MAXN];
long long a[MAXN], b[MAXN], dp[MAXN];
void dfs(int u) {
  dp[u] = b[u] - a[u];
  for (int i = 0; i < (int)e[u].size(); i++) {
    int v = e[u][i].first, r = e[u][i].second;
    dfs(v);
    if (dp[v] < 0) {
      if (-dp[v] < INF / r)
        dp[u] += dp[v] * r;
      else
        dp[u] = -INF;
      if (dp[u] < -INF) dp[u] = -INF;
    } else
      dp[u] += dp[v];
  }
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &b[i]);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (int i = 2; i <= n; i++) {
    int x, k;
    scanf("%d%d", &x, &k);
    e[x].push_back(make_pair(i, k));
  }
  dfs(1);
  return 0 * printf("%s\n", (dp[1] >= 0 ? "YES" : "NO"));
}
