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;
int n;
pair<int, long long> par[100010];
vector<int> adj[100010];
long long need[100010];
long long cur[100010];
long long bad(long long a, long long b) {
  double x = (double)a * b;
  if (x < -2e17) {
    cout << "NO\n";
    exit(0);
  }
  return a * b;
}
long long dfs(int v) {
  for (int e : adj[v]) {
    cur[v] += dfs(e);
    bad(cur[v], 1);
  }
  long long diff = cur[v] - need[v];
  if (diff >= 0) {
    return bad(diff, 1);
  } else {
    return bad(diff, par[v].second);
  }
}
int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> cur[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> need[i];
  }
  for (int i = 1; i < n; i++) {
    cin >> par[i].first >> par[i].second;
    par[i].first--;
    adj[par[i].first].push_back(i);
  }
  par[0].second = 1;
  dfs(0);
  if (need[0] > cur[0]) {
    cout << "NO\n";
  } else {
    cout << "YES\n";
  }
  return 0;
}
