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 mx = 1e18;
long long n, tot, e[500010], hd[500010], nt[500010], f[500010], val[500010],
    a[500010], b[500010];
void build(long long x, long long y, long long w) {
  tot++;
  e[tot] = y;
  val[tot] = w;
  nt[tot] = hd[x];
  hd[x] = tot;
}
void dfs(long long x, long long fa) {
  long long i, now;
  f[x] = a[x];
  for (i = hd[x]; i; i = nt[i]) {
    if (e[i] == fa) continue;
    dfs(e[i], x);
    if (f[e[i]] < 0) {
      f[e[i]] = -f[e[i]];
      if (mx / val[i] < f[e[i]])
        now = mx;
      else
        now = f[e[i]] * val[i];
      f[x] -= now;
      f[x] = max(f[x], -mx);
    } else
      f[x] += f[e[i]];
  }
}
int main() {
  long long i, x, y;
  scanf("%lld", &n);
  for (i = 1; i <= n; i++) {
    scanf("%lld", &b[i]);
  }
  for (i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
    a[i] = b[i] - a[i];
  }
  for (i = 2; i <= n; i++) {
    scanf("%lld%lld", &x, &y);
    build(x, i, y);
  }
  dfs(1, 0);
  if (f[1] >= 0)
    puts("YES");
  else
    puts("NO");
}
