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 = 1000000000000000000;
int fa[MAXN];
vector<pair<int, int> > tree[MAXN];
long long a[MAXN];
long long b[MAXN];
long long val[MAXN];
long long f[MAXN];
long long multi(const long long x, const long long y) {
  if (x >= INF / y) return INF;
  return x * y;
}
void dfs(const int u, const long long k) {
  for (auto cur : tree[u]) {
    int v(cur.first), k(cur.second);
    dfs(v, k);
    if (f[v] >= INF) {
      f[u] = INF;
      return;
    }
    if (f[v] > 0) val[u] -= f[v];
  }
  if (val[u] >= 0) {
    f[u] = 0;
    val[fa[u]] += val[u];
  } else
    f[u] = multi(-val[u], k);
}
bool solve(const int n) {
  for (int i(1); i <= n; ++i) val[i] = b[i] - a[i];
  dfs(1, 1);
  if (f[1] > 0)
    return false;
  else
    return true;
}
int main() {
  int n;
  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, k; i <= n; ++i) {
    scanf("%d %d", &x, &k);
    tree[x].push_back(pair<int, int>(i, k));
    fa[i] = x;
  }
  if (solve(n))
    puts("YES");
  else
    puts("NO");
  return 0;
}
