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;
using ld = long double;
constexpr int MOD = 1000000007;
constexpr ll INF = (1LL << 61) - 1;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
void fail(T v) {
  cout << v << endl;
  exit(0);
}
vector<int> G[100100];
vector<ll> A, B, K;
ll dfs(int i) {
  ll now = 0;
  for (int& e : G[i]) {
    now += dfs(e);
  }
  now += B[i] - A[i];
  if (now >= 0) return now;
  if (abs((double)now * K[i]) > 2e17) fail("NO");
  return now * K[i];
}
void solve() {
  int N;
  cin >> N;
  A.resize(N);
  B.resize(N);
  K.resize(N);
  for (int i = 0; i < (int)(N); ++i) cin >> B[i];
  for (int i = 0; i < (int)(N); ++i) cin >> A[i];
  K[0] = 1;
  for (int i = 0; i < (int)(N - 1); ++i) {
    int x;
    cin >> x >> K[i + 1];
    x--;
    G[x].push_back(i + 1);
  }
  ll res = dfs(0);
  if (res >= 0)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  solve();
  return 0;
}
