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;
using ll = long long;
template <class T, class U>
ostream& operator<<(ostream& o, const pair<T, U>& p) {
  o << "(" << p.first << "," << p.second << ")";
  return o;
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& v) {
  o << "[";
  for (T t : v) {
    o << t << ",";
  }
  o << "]";
  return o;
}
const string ok = "YES", ng = "NO";
const ll INF = 100000000000000000LL;
inline ll mul(ll x, ll y) {
  if (x > INF / y) return -1;
  return x * y;
}
string solve() {
  int n;
  cin >> n;
  vector<ll> b(n), a(n);
  for (int(i) = 0; (i) < (int)(n); ++(i)) cin >> b[i];
  for (int(i) = 0; (i) < (int)(n); ++(i)) cin >> a[i];
  vector<int> x(n - 1), k(n - 1);
  for (int(i) = 0; (i) < (int)(n - 1); ++(i)) {
    cin >> x[i] >> k[i];
    --x[i];
  }
  for (int i = n - 1; i > 0; --i) {
    if (b[i] >= a[i]) {
      b[x[i - 1]] += b[i] - a[i];
      b[i] = a[i];
    } else {
      ll need = mul(a[i] - b[i], k[i - 1]);
      if (need == -1) return ng;
      b[x[i - 1]] -= need;
      if (b[x[i - 1]] < -INF) return ng;
      b[i] = a[i];
    }
  }
  for (int(i) = 0; (i) < (int)(n); ++(i))
    if (b[i] < a[i]) return ng;
  return ok;
}
int main() {
  cout << solve() << endl;
  return 0;
}
