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;
inline int iin() {
  int x;
  scanf("%d", &x);
  return x;
}
inline long long int lin() {
  long long int x;
  scanf("%lld", &x);
  return x;
}
const long long int N = 1e6 + 85;
const long long int M = 1e3 + 85;
const long long int mod = 1e9 + 7;
const long long int pinf = LLONG_MAX;
const long long int minf = LLONG_MIN;
long long int arr[N];
vector<pair<long long int, long double> > edge[N];
map<int, bool> mark;
void DFS(int v) {
  mark[v] = true;
  for (auto e : edge[v])
    if (!mark[e.first]) {
      DFS(e.first);
      if (arr[e.first] >= 0)
        arr[v] += arr[e.first];
      else {
        if (arr[e.first] * 0.1 * e.second + arr[v] < -1e18) {
          cout << "NO\n";
          exit(0);
        }
        arr[v] += arr[e.first] * e.second;
      }
    }
}
int32_t main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> arr[i];
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    arr[i] -= x;
  }
  for (int i = 2; i <= n; i++) {
    long long int x, k;
    cin >> x >> k;
    edge[x].push_back({i, k});
  }
  DFS(1);
  return cout << (arr[1] >= 0 ? "YES\n" : "NO\n") << endl, 0;
}
