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 mxn = 1e5 + 5;
long long n, m;
long long a[mxn], b[mxn];
long double c[mxn];
vector<pair<long long, long long> > g[mxn];
long long ord[mxn], cur;
long long fa[mxn], kk[mxn];
inline void dfs(long long x, long long par = 0, long long tk = 0) {
  fa[x] = par;
  kk[x] = tk;
  for (long long i = 0; i < g[x].size(); ++i) {
    long long y = g[x][i].first, t = g[x][i].second;
    if (y == par) continue;
    dfs(y, x, t);
  }
  ord[++cur] = x;
}
inline void solve() {
  cin >> n;
  for (long long i = 1; i <= n; ++i) cin >> b[i];
  for (long long i = 1; i <= n; ++i) cin >> a[i], c[i] = b[i] - a[i];
  for (long long i = 2; i <= n; ++i) {
    long long x, d;
    cin >> x >> d;
    g[x].push_back(make_pair(i, d));
    g[i].push_back(make_pair(x, d));
  }
  dfs(1);
  for (long long ti = 1; ti < n; ++ti) {
    long long i = ord[ti];
    long long p = fa[i];
    if (c[i] > 0)
      c[p] += c[i];
    else
      c[p] += c[i] * kk[i];
    if (c[p] < -400000000000000000ll) {
      cout << "NO\n";
      exit(0);
    }
  }
  if (c[1] >= 0)
    printf("YES");
  else
    printf("NO");
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  long long T = 1;
  for (; T--;) solve();
}
