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 long long oo = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-9;
vector<long long> have, need;
vector<long long> p, k;
vector<vector<long long> > ch;
void fail() {
  cout << "NO" << endl;
  exit(0);
}
long long dfs(long long i) {
  long long total = have[i] - need[i];
  for (long long j : ch[i]) {
    long long cur = dfs(j);
    if (cur < 0) {
      if (abs(cur * 1.0 * k[j]) > 2e17) fail();
      cur *= k[j];
    }
    total += cur;
    if (abs(total) > 2e17) fail();
  }
  return total;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  have.resize(n), need.resize(n);
  for (long long i = (0); i < (n); i++) cin >> have[i];
  for (long long i = (0); i < (n); i++) cin >> need[i];
  p.resize(n), k.resize(n);
  ch.resize(n);
  for (long long i = (1); i < (n); i++) {
    cin >> p[i] >> k[i];
    p[i]--;
    ch[p[i]].push_back(i);
  }
  cout << (dfs(0) >= 0 ? "YES" : "NO") << endl;
}
