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;
int main() {
  ios::sync_with_stdio(false);
  long double n, x, k;
  cin >> n;
  vector<long double> a(n), b(n), p(n), t(n), deti(n, 0);
  for (int(i) = 0; (i) < (n); (i)++) cin >> b[i];
  for (int(i) = 0; (i) < (n); (i)++) cin >> a[i];
  for (int(i) = 0; (i) < (n); (i)++) {
    long double mam = min(a[i], b[i]);
    b[i] -= a[i];
  }
  for (int(i) = 0; (i) < (n - 1); (i)++) {
    cin >> x >> k;
    t[i + 1] = k;
    p[i + 1] = x - 1;
    deti[x - 1]++;
  }
  queue<int> qe;
  for (int(i) = 0; (i) < (n); (i)++)
    if (deti[i] == 0) qe.push(i);
  while (!qe.empty()) {
    x = qe.front();
    qe.pop();
    if (x == 0) break;
    int diff = b[x];
    if (diff > 0) {
      b[p[x]] += diff;
    } else {
      b[p[x]] += t[x] * diff;
    }
    b[x] = a[x];
    deti[p[x]]--;
    if (deti[p[x]] == 0) qe.push(p[x]);
  }
  if (b[0] >= 0.5)
    cout << "YES";
  else
    cout << "NO";
  cout << endl;
  return 0;
}
