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 mod = 1e9 + 7;
const int N = 1e5 + 4;
vector<pair<int, int> > v[N];
long long dif[N];
void dfs(int node, int par) {
  for (auto it : v[node]) {
    int x = it.first;
    if (x == par) continue;
    dfs(x, node);
    if (dif[x] > 0) dif[node] += dif[x];
  }
  for (auto it : v[node]) {
    int x = it.first, wt = it.second;
    if (x == par) continue;
    if (dif[x] < 0) {
      long long req = -dif[x];
      dif[x] = 0, dif[node] -= (wt * req);
    }
  }
}
int main() {
  int n;
  scanf("%d", &n);
  long long a[n + 1], b[n + 1];
  for (int i = 1; i < n + 1; i++) scanf("%lld", &b[i]);
  for (int i = 1; i < n + 1; i++) scanf("%lld", &a[i]);
  for (int i = 1; i < n + 1; i++) dif[i] = b[i] - a[i];
  for (int i = 2; i < n + 1; i++) {
    int par, wt;
    scanf("%d", &par);
    scanf("%d", &wt);
    v[i].emplace_back(par, wt);
    v[par].emplace_back(i, wt);
  }
  dfs(1, -1);
  if (dif[1] >= 0)
    printf("YES");
  else
    printf("NO");
}
