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 long long int mod = 1e15 + 7;
const long long int maxn = 1e6 + 10;
const long long inf = 1e18 + 18;
double pie = 3.1415926535;
long long int a[maxn], b[maxn];
vector<pair<long long int, long long int> > adj[maxn];
long long mult(long long a, long long b) {
  if (a >= inf / b + 2) {
    return inf;
  }
  return min(a * b, inf);
}
void dfs(long long int s) {
  if (a[s] <= -inf) {
    cout << "NO";
    exit(0);
  }
  long long int i, node, k;
  for (i = 0; i < int(adj[s].size()); i++) {
    node = adj[s][i].first;
    k = adj[s][i].second;
    dfs(node);
    if (a[node] < b[node]) {
      if (mult(b[node] - a[node], k) >= inf) {
        cout << "NO";
        exit(0);
      }
      if ((a[s] - mult(b[node] - a[node], k)) <= -inf) {
        cout << "NO";
        exit(0);
      }
      a[s] = a[s] - (b[node] - a[node]) * k;
    } else {
      a[s] += a[node] - b[node];
    }
  }
}
int main() {
  long long int n, x, k, i;
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  for (i = 1; i <= n; i++) cin >> a[i];
  for (i = 1; i <= n; i++) cin >> b[i];
  for (i = 2; i <= n; i++) {
    cin >> x >> k;
    adj[x].push_back({i, k});
  }
  dfs(1);
  if (a[1] >= b[1])
    cout << "YES";
  else
    cout << "NO";
}
