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;
const int N = 1e5 + 5;
int n;
long long ar[N], br[N];
struct T {
  int dest, type;
  long long cost;
};
vector<T> graf[N];
int cnt[N] = {};
int main(void) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> ar[i];
  for (int i = 0; i < n; ++i) cin >> br[i];
  for (int i = 0; i < n; ++i) ar[i] -= br[i];
  for (int i = 1; i < n; ++i) {
    int x, k;
    cin >> x >> k;
    --x;
    graf[i].push_back({x, 0, k});
    graf[x].push_back({i, 1, k});
    ++cnt[i], ++cnt[x];
  }
  stack<int> st;
  for (int i = 1; i < n; ++i)
    if (graf[i].size() == 1) st.push(i);
  while (st.size()) {
    int x = st.top();
    st.pop();
    --cnt[x];
    if (cnt[x] > 1 || !x) continue;
    T y;
    for (auto z : graf[x]) {
      if (cnt[z.dest]) y = z;
    }
    if (ar[x] > 0)
      ar[y.dest] += ar[x] / (y.type ? y.cost : 1);
    else if (ar[x] < 0) {
      if (y.type)
        ar[y.dest] += ar[x];
      else {
        if (double(y.cost) * ar[x] < -1e18) {
          cout << "NO" << endl;
          exit(0);
        }
        ar[y.dest] += ar[x] * y.cost;
      }
    }
    if (ar[y.dest] < -1e18) {
      cout << "NO" << endl;
      exit(0);
    }
    cnt[x] = 0;
    st.push(y.dest);
  }
  if (ar[0] >= 0)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
