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;
vector<long long> start, needed;
vector<bool> been;
vector<vector<pair<long long, long long> > > graph;
int main() {
  long long n;
  cin >> n;
  been.assign(n, false);
  graph.resize(n);
  for (long long i = 0; n > i; i++) {
    long long temp;
    cin >> temp;
    start.push_back(temp);
  }
  for (long long i = 0; n > i; i++) {
    long long temp;
    cin >> temp;
    needed.push_back(temp);
  }
  for (long long i = 0; n - 1 > i; i++) {
    long long a, suly;
    cin >> a >> suly;
    pair<long long, long long> temp;
    temp.first = a - 1;
    temp.second = suly;
    graph[i + 1].push_back(temp);
  }
  for (long long i = n - 1; i >= 0; i--) {
    long long howManyToSend = start[i] - needed[i];
    long long smallest = n + 1;
    long long szorzo = 1;
    for (auto elem : graph[i]) {
      if (elem.first < smallest) {
        szorzo = elem.second;
        smallest = elem.first;
      }
    }
    if (howManyToSend < 0) {
      if (howManyToSend < 9000000000) {
        cout << "NO" << endl;
        return 0;
      }
      howManyToSend *= szorzo;
    }
    start[smallest] += howManyToSend;
  }
  if (start[0] >= needed[0]) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
  return 0;
}
