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 MOD = 1000000007LL;
int n;
long long a[100010];
long long b[100010];
vector<int> tree[100010];
vector<int> cost[100010];
long long rec(int p) {
  long long res = b[p] - a[p];
  for (int i = 0, _n = tree[p].size(); i < _n; i++) {
    long long r = rec(tree[p][i]);
    if (r >= 0)
      res += r;
    else
      res += r * cost[p][i];
  }
  return res;
}
int main() {
  scanf("%d", &n);
  for (int i = 0, _n = n; i < _n; i++) scanf("%lld", b + i + 1);
  for (int i = 0, _n = n; i < _n; i++) scanf("%lld", a + i + 1);
  for (int i = 2, _n = n + 1; i < _n; i++) {
    long long x, k;
    scanf("%lld%lld", &x, &k);
    tree[x].push_back(i);
    cost[x].push_back(k);
  }
  if (rec(1) >= 0)
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}
