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;
vector<int> g[100111];
long long a[100111], b[100111];
long long dp[100111];
long long wt[100111];
int n;
void dfs(int v) {
  for (auto nv : g[v]) {
    dfs(nv);
    if (dp[nv] < 0) {
      if ((1ll << 61) / wt[nv] <= -dp[nv]) {
        dp[nv] = 0;
        dp[v] = -(1ll << 61);
      } else {
        dp[v] += dp[nv] * wt[nv];
        dp[nv] = 0;
        if (dp[v] < -(1ll << 61)) dp[v] = -(1ll << 61);
      }
    } else {
      dp[v] += dp[nv];
      dp[nv] = 0;
    }
  }
}
int main() {
  int i;
  scanf("%d", &n);
  for (i = 1; i <= n; ++i) {
    scanf("%I64d", &b[i]);
  }
  for (i = 1; i <= n; ++i) {
    scanf("%I64d", &a[i]);
  }
  for (i = 1; i <= n; ++i) {
    dp[i] = b[i] - a[i];
  }
  for (i = 2; i <= n; ++i) {
    int v;
    long long k;
    scanf("%d%I64d", &v, &k);
    g[v].push_back(i);
    wt[i] = k;
  }
  dfs(1);
  printf("%s\n", dp[1] >= 0 ? "YES" : "NO");
  return 0;
}
