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 mod = 1e9 + 7;
const int maxn = 1e6 + 5;
long long int power(long long int base, long long int exp) {
  long long int res = 1;
  while (exp) {
    if (exp % 2) res *= base;
    base *= base;
    res %= mod;
    base %= mod;
    exp /= 2;
  }
  return res;
}
long long int u[maxn], v[maxn], a[maxn], b[maxn];
vector<pair<long long int, long long int> > adj[maxn];
void dfs(long long int i) {
  if (b[i] < -1e18) {
    cout << "NO";
    exit(0);
  }
  for (auto next : adj[i]) {
    dfs(next.first);
  }
  if (i == 1) {
    if (a[i] > b[i]) {
      cout << "NO";
      exit(0);
    } else {
      cout << "YES";
      exit(0);
    }
  }
  if (a[i] > b[i]) {
    long long int how = a[i] - b[i];
    if (1.0 * b[u[i]] - 1.0 * v[i] * how < -2e17) {
      cout << "NO";
      exit(0);
    }
    b[u[i]] -= (v[i] * how);
  } else {
    long long int how = b[i] - a[i];
    b[u[i]] += how;
  }
  b[i] = a[i];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, i;
  cin >> n;
  for (i = 1; i <= n; i++) cin >> b[i];
  for (i = 1; i <= n; i++) cin >> a[i];
  for (i = 2; i <= n; i++) {
    cin >> u[i] >> v[i];
    adj[u[i]].push_back({i, v[i]});
  }
  dfs(1);
  return 0;
}
