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;
struct edge {
  long long to, cost;
  edge() {}
  edge(long long a, long long b) { to = a, cost = b; }
};
long long n;
long long a[100005], b[100005];
vector<edge> G[100005];
bool used[100005];
bool dfs(int v, long long s) {
  used[v] = true;
  s += b[v] - a[v];
  bool ret = false;
  if (G[v][0].cost >= 2) ret = true;
  ;
  if (used[G[v][0].to]) return s >= 0;
  return ret || dfs(G[v][0].to, s);
}
long long calc(long long v) {
  used[v] = true;
  long long ret = b[v] - a[v];
  for (auto e : G[v]) ret += calc(e.to) * e.cost;
  (ret) = min((ret), ((long long)1e13)), (ret) = max((ret), ((long long)-1e13));
  return ret;
}
int main(void) {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (long long(i) = (1); (i) <= (n); (i)++) cin >> b[i];
  for (long long(i) = (1); (i) <= (n); (i)++) cin >> a[i];
  long long x, k;
  for (long long(i) = (2); (i) <= (n); (i)++) {
    cin >> x >> k;
    G[x].push_back(edge(i, k));
  }
  if (calc(1) < 0) {
    cout << "NO" << endl;
    return 0;
  }
  for (long long(i) = (1); (i) <= (n); (i)++) {
    if (used[i]) continue;
    if (!dfs(i, 0)) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  return 0;
}
