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;
long long n, i, j, k, x, y, z, m, q, h, l, timer;
long long a[100500], b[100500], w[100500];
vector<pair<long long, long long> > g[100500];
void dfs(long long v, long long p = -1) {
  w[v] = a[v] - b[v];
  for (int i = 0; i < g[v].size(); i++) {
    long long to = g[v][i].first;
    if (to != p) {
      dfs(to, v);
      long long val = g[v][i].second;
      if (w[to] > 0)
        w[v] += w[to];
      else if (w[to] < 0) {
        long long cur = -w[to];
        if (cur > ((long long)1e+18) / val + 1) {
          cout << "NO" << endl;
          exit(0);
        }
        w[v] -= cur * val;
      }
    }
  }
}
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (i = 1; i <= n; i++) {
    cin >> b[i];
  }
  for (i = 2; i <= n; i++) {
    cin >> x >> y;
    g[x].push_back(make_pair(i, y));
    g[i].push_back(make_pair(x, y));
  }
  dfs(1);
  if (w[1] < 0)
    cout << "NO" << endl;
  else
    cout << "YES" << endl;
  return 0;
}
