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;
template <class T>
inline T bigmod(T p, T e, T M) {
  T ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T, class X>
inline bool getbit(T a, X i) {
  T t = 1;
  return ((a & (t << i)) > 0);
}
template <class T, class X>
inline T setbit(T a, X i) {
  T t = 1;
  return (a | (t << i));
}
template <class T, class X>
inline T resetbit(T a, X i) {
  T t = 1;
  return (a & (~(t << i)));
}
long long n, b[100009], a[100009], k[100009];
vector<int> graph[100009];
long long dfs(int u) {
  if (graph[u].empty()) {
    if (a[u] >= b[u]) {
      long long ret = log10(k[u]) + log10((a[u] - b[u]));
      if (ret >= log10(((long long)1e17)) || k[u] * (a[u] - b[u]) >= 1e17)
        return 1e17;
      return k[u] * (a[u] - b[u]);
    } else
      return a[u] - b[u];
  }
  for (int i = (0); i <= (graph[u].size() - 1); i++) {
    int v = graph[u][i];
    a[u] += dfs(v);
    if (a[u] >= 1e17) return 1e17;
  }
  if (u == 1) {
    if (a[u] == b[u])
      return 0;
    else
      return 1;
  }
  if (a[u] >= b[u]) {
    long long ret = log10(k[u]) + log10((a[u] - b[u]));
    if (ret >= log10(((long long)1e17)) || k[u] * (a[u] - b[u]) >= 1e17)
      return 1e17;
    return k[u] * (a[u] - b[u]);
  } else
    return a[u] - b[u];
}
int main() {
  long long x;
  scanf("%lld", &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++) {
    scanf("%lld %lld", &x, &k[i]);
    graph[x].push_back(i);
  }
  if (n == 1) {
    if (a[1] == b[1]) {
      cout << "YES" << '\n';
    } else
      cout << "NO" << '\n';
    return 0;
  }
  long long ret = dfs(1);
  if (ret == 0)
    cout << "YES" << '\n';
  else
    cout << "NO" << '\n';
  return 0;
}
