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<pair<int, double> > e[100010];
int N;
double a[100010], b[100010], f[100010];
bool ok = true;
void dfs(int x) {
  f[x] = b[x] - a[x];
  for (auto t : e[x]) {
    dfs(t.first);
    if (f[t.first] < 0)
      f[x] += t.second * f[t.first];
    else
      f[x] += f[t.first];
    if (f[x] < -1e20) ok = false;
  }
}
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) scanf("%lf", &b[i]);
  for (int i = 1; i <= N; i++) scanf("%lf", &a[i]);
  for (int i = 2; i <= N; i++) {
    int u;
    double w;
    scanf("%d%lf", &u, &w);
    e[u].push_back(make_pair(i, w));
  }
  dfs(1);
  puts(f[1] > -1e-12 && ok ? "YES" : "NO");
}
