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;
template <class T>
void dbs(string str, T t) {
  cerr << str << " : " << t << "\n";
}
template <class T, class... S>
void dbs(string str, T t, S... s) {
  int idx = str.find(',');
  cerr << str.substr(0, idx) << " : " << t << ",";
  dbs(str.substr(idx + 1), s...);
}
template <class S, class T>
ostream& operator<<(ostream& os, const pair<S, T>& p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class S, class T>
ostream& operator<<(ostream& os, const map<S, T>& p) {
  os << "[ ";
  for (auto& it : p) os << it << " ";
  return os << "]";
}
template <class T>
void prc(T a, T b) {
  cerr << "[";
  for (T i = a; i != b; ++i) {
    if (i != a) cerr << ", ";
    cerr << *i;
  }
  cerr << "]\n";
}
long long b[100010];
long long a[100010];
vector<tuple<int, int>> Adj[100010];
bool poss = true;
void DFS(int u, int p, long long multi = -1) {
  bool leaf = true;
  long long remain = 0;
  for (auto v : Adj[u]) {
    if (p != get<0>(v)) {
      leaf = false;
      DFS(get<0>(v), u, get<1>(v));
    }
  }
  if (b[u] < a[u] && multi != -1 && p != 0) {
    long long required = (a[u] - b[u]) * multi;
    b[u] = a[u];
    b[p] -= required;
  } else if (p != 0) {
    b[p] += b[u] - a[u];
  }
  if (b[u] < a[u] || b[u] < -2 * 1e7) {
    poss = false;
  }
  return;
}
int main() {
  int n;
  cin >> n;
  for (int i = (int)(1); i <= (int)(n); i++) {
    cin >> b[i];
  }
  for (int i = (int)(1); i <= (int)(n); i++) {
    cin >> a[i];
  }
  for (int i = (int)(1); i <= (int)(n - 1); i++) {
    int x1, k;
    cin >> x1 >> k;
    Adj[x1].push_back(make_tuple(i + 1, k + 1));
    Adj[i + 1].push_back(make_tuple(x1, k + 1));
  }
  DFS(1, 0);
  if (poss) {
    cout << "YES"
         << "\n";
  } else {
    cout << "NO"
         << "\n";
  }
  return 0;
}
