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;
inline long long getint() {
  long long c, x;
  for (; !isdigit(c = getchar());)
    ;
  for (x = c - '0'; isdigit(c = getchar()); x = x * 10 + c - '0')
    ;
  return x;
}
void fail() {
  puts("NO");
  exit(0);
}
const long double inf = 1e18;
const long long Inf = 200000000000000000ll;
const int N = 300010;
int G[N], ne[N], to[N], da[N], n, xb;
long long a[N], b[N];
bool tst(long long x, long long y) { return fabsl((long double)x * y) > inf; }
long long dfs(int x) {
  long long ans = b[x] - a[x];
  for (int i = G[x]; ~i; i = ne[i]) {
    long long y = dfs(to[i]);
    if (y > 0)
      ans += y;
    else {
      if (tst(y, da[i])) fail();
      ans = ans + y * da[i];
      if (ans < -Inf) fail();
    }
  }
  return ans;
}
void add(int z, int y, int x) {
  ne[xb] = G[x];
  to[xb] = y;
  da[xb] = z;
  G[x] = xb++;
}
int main() {
  n = getint();
  memset(G, -1, sizeof G);
  for (int i = 1; i <= n; i++) b[i] = getint();
  for (int i = 1; i <= n; i++) a[i] = getint();
  for (int i = 2; i <= n; i++) add(getint(), i, getint());
  if (dfs(1) >= 0)
    puts("YES");
  else
    puts("NO");
  return 0;
}
