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 INF = 1e18;
vector<vector<long long> > data;
vector<vector<long long> > money;
long long n, ai, bi;
vector<long long> a, b;
bool res = true;
long long dfs(long long vertex, long long ed) {
  long long balance = b[vertex] - a[vertex];
  for (long long i = 0; i < data[vertex].size(); i++) {
    long long to = data[vertex][i];
    balance -= dfs(to, money[vertex][i]);
    if (balance <= -INF) {
      res = false;
    }
    if (!res) {
      return 0;
    }
  }
  if (balance >= 0) {
    return -balance;
  }
  if (vertex == 0) {
    res = false;
    return 0;
  }
  long long max_wanted = INF / ed + 2;
  long long wanted = -balance;
  if (wanted > max_wanted) {
    res = false;
    return 0;
  }
  return (-balance * ed);
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> bi;
    b.push_back(bi);
  }
  for (long long i = 0; i < n; i++) {
    cin >> ai;
    a.push_back(ai);
  }
  for (long long i = 0; i < n; i++) {
    vector<long long> h1, h2;
    data.push_back(h1);
    money.push_back(h2);
  }
  for (long long i = 0; i < n - 1; i++) {
    cin >> ai >> bi;
    data[ai - 1].push_back(i + 1);
    money[ai - 1].push_back(bi);
  }
  dfs(0, -1);
  if (res)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
