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 = 111111;
const long long inf = (long long)2e17;
long long a[N], b[N], k[N], x;
int f[N];
vector<int> v[N];
long long sa, sb;
int main() {
  int n, i;
  scanf("%d", &n);
  for (i = 1; i <= n; i = i + 1) scanf("%d", b + i), sb += b[i];
  for (i = 1; i <= n; i = i + 1) scanf("%d", a + i), sa += a[i];
  if (sb < sa) {
    cout << "NO\n";
    return 0;
  }
  f[1] = 0;
  for (i = 2; i <= n; i = i + 1) {
    scanf("%d%d", f + i, k + i);
    v[f[i]].push_back(i);
  }
  for (i = n; i >= 2; i = i - 1) {
    if (a[i] <= b[i]) {
      b[f[i]] += (long long)b[i] - a[i];
      b[i] = a[i];
    } else {
      x = inf / k[i];
      if (a[i] - b[i] > x + 1) {
        cout << "NO\n";
        return 0;
      }
      b[f[i]] -= (long long)k[i] * (a[i] - b[i]);
      if (b[f[i]] < -inf) {
        cout << "NO\n";
        return 0;
      }
    }
  }
  if (a[i] > b[i])
    cout << "NO\n";
  else
    cout << "YES\n";
  return 0;
}
