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 <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
template <class T>
ostream& operator<<(ostream& os, vector<T> V) {
  os << "[ ";
  for (auto v : V) os << v << " ";
  return os << "]";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
template <typename T, typename U>
pair<T, U> operator+(const pair<T, U>& l, const std::pair<T, U>& r) {
  return {l.first + r.first, l.second + r.second};
}
const long long int md = 998244353;
const long long int maxn = 1e5 + 5;
long long int a[maxn], b[maxn];
vector<pair<long long int, long long int>> g[maxn];
long long int dfs(long long int u, long long int p) {
  for (auto v : g[u]) {
    long long int x = dfs(v.first, u);
    if (x < 0) {
      b[u] += -x;
    } else {
      if ((long double)(v.second) * x > 1e16) {
        cout << "NO" << '\n';
        exit(0);
      }
      b[u] -= v.second * x;
      if (b[u] < -1e16) {
        cout << "NO" << '\n';
        exit(0);
      }
    }
  }
  return a[u] - b[u];
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n;
  cin >> n;
  vector<long long int> p(n + 1), k(n + 1);
  for (long long int i = 1; i <= n; i++) {
    cin >> b[i];
  }
  for (long long int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (long long int i = 2; i <= n; i++) {
    cin >> p[i] >> k[i];
    g[p[i]].push_back({i, k[i]});
  }
  long long int res = dfs(1, 0);
  if (res > 0)
    cout << "NO" << '\n';
  else
    cout << "YES" << '\n';
}
