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 int binpow(long long int a, long long int b) {
  a %= 1000000007;
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res;
}
long long int a[100005], b[100005], vis[100005], x[100005], k[100005];
vector<long long int> adj[100005];
void dfs(long long int n) {
  vis[n] = 1;
  for (auto xx : adj[n]) {
    if (vis[xx] == 0) {
      dfs(xx);
      a[n] += k[xx] * max(0LL, a[xx] - b[xx]);
      b[n] += max(0LL, b[xx] - a[xx]);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, i, fl = 0;
  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 >> x[i] >> k[i];
    adj[i].push_back(x[i]);
    adj[x[i]].push_back(i);
  }
  for (i = 1; i <= n; i++) {
    if (vis[i] == 0) {
      dfs(i);
      if (b[i] < a[i]) {
        fl = 1;
        break;
      }
    }
  }
  if (fl) {
    cout << "NO";
  } else {
    cout << "YES";
  }
}
