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 NIL = -1;
template <class T>
inline T mx(T a, T b) {
  return a > b ? a : b;
}
template <class T>
inline T mi(T a, T b) {
  return a < b ? a : b;
}
template <class T>
inline void sw(T &a, T &b) {
  T t = a;
  a = b;
  b = t;
}
template <class T>
inline T mabs(T x) {
  return x < 0 ? -x : x;
}
inline char gc() {
  char ret;
  while ((ret = getchar()) == ' ' || ret == '\n' || ret == '\t')
    ;
  return ret;
}
const int LIM = 1e5 + 10;
int n;
long long a[LIM], b[LIM];
vector<pair<int, long long> > adj[LIM];
bool dfs(int crt, long long pre, int fa) {
  vector<pair<int, long long> > &t = adj[crt];
  for (int i = 0; i < t.size(); i++)
    if (!dfs(t[i].first, t[i].second, crt)) return false;
  if (crt == 1) return a[crt] == b[crt];
  if (a[crt] < 0) return false;
  if (b[crt] > a[crt]) {
    long long dif = b[crt] - a[crt];
    if (dif * pre < 0) return false;
    long long need = dif * pre;
    a[crt] += need, a[fa] -= need;
    return true;
  } else if (b[crt] < a[crt]) {
    long long dif = a[crt] - b[crt];
    a[crt] -= dif, a[fa] += dif;
    return true;
  }
  return true;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL), cout.tie(NULL);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) cin >> b[i];
  int v;
  long long w;
  for (int i = 2; i <= n; i++) {
    cin >> v >> w;
    adj[v].push_back(make_pair(i, w));
  }
  cout << (dfs(1, 0, -1) ? "YES" : "NO");
  return 0;
}
