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 lim = 1e18;
int n;
long long a[100100], b[100100];
vector<pair<int, int> > v[100100];
long long ksc(long long x, int y) {
  long long z = 0;
  for (; y; y >>= 1, x *= 2) {
    if (x < -lim) {
      puts("NO");
      exit(0);
    }
    if (y & 1) {
      z += x;
      if (z < -lim) {
        puts("NO");
        exit(0);
      }
    }
  }
  return z;
}
long long dfs(int x) {
  long long ret = 0;
  for (auto y : v[x]) {
    long long tmp = dfs(y.first);
    if (tmp >= 0)
      ret += tmp;
    else {
      tmp = ksc(tmp, y.second);
      ret += tmp;
      if (ret < -lim) {
        puts("NO");
        exit(0);
      }
    }
  }
  ret += b[x] - a[x];
  if (ret < -lim) {
    puts("NO");
    exit(0);
  }
  return ret;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &b[i]);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (int i = 2, x, y; i <= n; i++)
    scanf("%d%d", &x, &y), v[x].push_back(make_pair(i, y));
  long long tmp = dfs(1);
  puts(tmp >= 0 ? "YES" : "NO");
  return 0;
}
