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;
typedef struct {
  int sum, suf, pre, max;
} Node;
int toint(const string &s) {
  stringstream ss;
  ss << s;
  int x;
  ss >> x;
  return x;
}
const int MAXN = 2e5 + 100;
const int UP = 31;
const long long int highest = 1e18;
const double Phi = 1.618033988749894;
const int logn = 20;
const double root5 = 2.236067977;
const long long int inf = 1e18;
const int N = 1e5 + 10;
std::vector<pair<int, int> > eds[N];
int n;
long long int b[N];
long long int a[N];
long long int mul(long long int a, long long int b) {
  if (a == 0) return 0;
  if (inf / a < b) return inf;
  return a * b;
}
long long int dfs(int v) {
  long long int have = b[v];
  long long int want = a[v];
  for (auto e : eds[v]) {
    long long int x = dfs(e.first);
    if (x < 0) {
      want = min(inf, want + mul(-x, e.second));
    } else {
      have += x;
    }
  }
  return have - want;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    cin >> b[i];
  }
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  for (int i = 1; i < n; ++i) {
    int x, k;
    scanf("%d%d", &x, &k);
    --x;
    eds[x].push_back(make_pair(i, k));
  }
  long long int ans = dfs(0);
  if (ans < 0) {
    return !printf("NO\n");
  } else {
    return !printf("YES\n");
  }
  return 0;
}
