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 int maxn = 111111;
const long long MAX = 10ll * 10000 * 10000 * 10000 * 10000;
long long A[maxn];
int fir[maxn], nxt[maxn], to[maxn], D[maxn], tot;
void add_edge(int x, int y, int z) {
  nxt[++tot] = fir[x], to[fir[x] = tot] = y, D[tot] = z;
}
int weishu(long long x) {
  int op = 0;
  long long uuu = 1;
  while (x >= uuu) ++op, uuu *= 10;
  return op;
}
long long dfs(int x) {
  long long uuu = A[x];
  for (int i = fir[x], v = to[i]; i; i = nxt[i], v = to[i]) {
    long long op = dfs(v);
    if (op == -MAX) return -MAX;
    if (op >= 0) {
      uuu += op;
      if (uuu >= MAX) return -MAX;
    } else {
      if (weishu(-op) + weishu(D[i]) > 17) return -MAX;
      uuu += op * D[i];
      if (uuu <= -MAX) return -MAX;
    }
  }
  return uuu;
}
int main() {
  int N;
  scanf("%d", &N);
  for (int i = 1; i <= N; ++i) scanf("%I64d", A + i);
  for (int i = 1; i <= N; ++i) scanf("%I64d", A), A[i] -= A[0];
  for (int i = 2; i <= N; ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    add_edge(a, i, b);
  }
  puts(dfs(1) < 0 ? "NO" : "YES");
  return 0;
}
