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 = 100005;
const long long inf = 0x7fffffffffffffff;
int n;
long long a[maxn], b[maxn], K[maxn];
vector<int> G[maxn];
inline long long add(long long a, long long b) {
  double ret = 1.0 * a + b;
  if (ret > 1e19) return inf;
  if (ret < -1e19) return -inf;
  return a + b;
}
inline long long mul(long long a, long long b) {
  double ret = 1.0 * a * b;
  if (ret > 1e19) return inf;
  if (ret < -1e19) return -inf;
  return a * b;
}
long long dfs(int u, int fa) {
  for (int i = 0; i < (int)G[u].size(); ++i) {
    int v = G[u][i];
    if (v == fa) continue;
    long long ret = dfs(v, u);
    if (ret > 0) b[u] = add(b[u], ret);
    if (ret < 0) {
      ret = -ret;
      long long prod = mul(ret, K[v]);
      b[u] = add(b[u], -prod);
    }
  }
  return add(b[u], -a[u]);
}
void print() {
  for (int i = 1; i <= n; ++i) {
    printf("i=%d: ", i);
    for (int j = 0; j < (int)G[i].size(); ++j)
      printf("%d%c", G[i][j], j + 1 == (int)G[i].size() ? '\n' : ' ');
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%I64d", &b[i]);
  for (int i = 1; i <= n; ++i) scanf("%I64d", &a[i]);
  for (int i = 2; i <= n; ++i) {
    int x;
    scanf("%d%I64d", &x, &K[i]);
    G[x].push_back(i);
  }
  puts(dfs(1, 0) >= 0 ? "YES" : "NO");
  return 0;
}
