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;
vector<long long> vc[100006], cost[100006];
long long ou[100006], cst[100006], pst[100006];
double lab[100006], lg[100006];
queue<int> q;
void dfs(int v, int par) {
  int ck = 0;
  for (int i = 0; i < vc[v].size(); i++) {
    int w = vc[v][i];
    if (w == par) continue;
    ck = 1;
    dfs(w, v);
    ou[v]++;
  }
  if (ck == 0) q.push(v);
}
int main() {
  long long i, j, k, l, m, n, v;
  double D, Q, R;
  scanf("%lld", &n);
  for (i = 1; i <= n; i++) {
    scanf("%lf", &lab[i]);
  }
  for (i = 1; i <= n; i++) {
    scanf("%lf", &lg[i]);
  }
  for (i = 2; i <= n; i++) {
    scanf("%lld%lld", &l, &k);
    vc[l].push_back(i);
    cost[l].push_back(k);
    cst[i] = k;
    pst[i] = l;
  }
  dfs(1, -1);
  while (!q.empty()) {
    v = q.front();
    q.pop();
    if (v == 1 && lab[v] < lg[v]) {
      printf("NO\n");
      return 0;
    } else if (v == 1) {
      printf("YES\n");
      return 0;
    }
    if (lab[v] < lg[v]) {
      long long D = lg[v] - lab[v];
      Q = D * cst[v];
      lab[pst[v]] -= Q;
      lab[v] = lg[v];
    } else {
      lab[pst[v]] += (lab[v] - lg[v]);
    }
    ou[pst[v]]--;
    if (ou[pst[v]] == 0) q.push(pst[v]);
  }
}
