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>
ostream &operator<<(ostream &os, vector<T> V) {
  os << "[ ";
  for (auto v : V) os << v << " ";
  os << "]";
  return os;
}
template <class T>
ostream &operator<<(ostream &os, set<T> S) {
  os << "{ ";
  for (auto s : S) os << s << " ";
  return os << "}";
}
template <class L, class R>
ostream &operator<<(ostream &os, map<L, R> M) {
  os << "{ ";
  for (auto m : M) os << "(" << m.first << ":" << m.second << ") ";
  return os << "}";
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
  return os << "(" << P.first << "," << P.second << ")";
}
const long long N = 100005;
long long n, a[N], b[N], lim = -2e17;
vector<pair<long long, long long>> adj[N];
bool neg;
long long dfs(long long x, long long pr) {
  long long flow = 0;
  if (neg) return 0;
  for (long long i = 0; i < adj[x].size(); i++) {
    if (adj[x][i].first == pr) continue;
    long long k = dfs(adj[x][i].first, x);
    if (k >= 0)
      flow += k;
    else {
      if (adj[x][i].second < lim / k) {
        neg = true;
        return 0;
      }
      flow += adj[x][i].second * k;
      if (flow < lim) {
        neg = true;
        return 0;
      }
    }
  }
  flow += b[x] - a[x];
  if (flow < lim) {
    neg = true;
    return 0;
  }
  return flow;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (long long i = 1; i < n + 1; i++) cin >> b[i];
  for (long long i = 1; i < n + 1; i++) cin >> a[i];
  for (long long i = 2; i < n + 1; i++) {
    long long x, w;
    cin >> x >> w;
    adj[x].push_back({i, w});
  }
  long long p = dfs(1, -1);
  if (neg)
    cout << "NO";
  else
    cout << ((p >= 0) ? "YES" : "NO");
  return 0;
}
