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;
long long gcd(long long n1, long long n2) {
  if (!n1) return n2;
  if (!n2) return n1;
  if (n1 % n2 == 0) return n2;
  return gcd(n2, n1 % n2);
}
long long powmod(long long base, long long exponent) {
  base %= 1000000007;
  long long ans = 1;
  while (exponent) {
    if (exponent & 1) ans = (ans * base) % 1000000007;
    base = (base * base) % 1000000007;
    exponent /= 2;
  }
  ans %= 1000000007;
  return ans;
}
long long b[200100 + 1];
long long a[200100 + 1];
long long arr[200100 + 1];
long long dp[200100 + 1];
vector<pair<int, int> > child[200100 + 1];
int x[200100 + 1];
int k[200100 + 1];
bool f = true;
void dfs(int node) {
  if (!f) return;
  for (int i = 0; i < child[node].size(); i++) {
    dfs(child[node][i].first);
    if (dp[child[node][i].first] >= 0) {
      dp[node] += dp[child[node][i].first];
    } else {
      long long temp = (1000000000000000100 / child[node][i].second);
      if (temp + dp[child[node][i].first] < 0) f = false;
      dp[node] += dp[child[node][i].first] * child[node][i].second;
      if (dp[node] + 1000000000000000100 < 0) f = false;
    }
  }
}
int main() {
  int n, i, j;
  scanf("%d", &n);
  for (i = 1; i <= n; i++) scanf("%lld", &b[i]);
  for (i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
    arr[i] = b[i] - a[i];
    dp[i] = arr[i];
  }
  for (i = 2; i <= n; i++) {
    scanf("%d", &x[i]);
    scanf("%d", &k[i]);
    child[x[i]].push_back(make_pair(i, k[i]));
  }
  dfs(1);
  f &= (dp[1] >= 0);
  if (f)
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}
