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;
template <typename T>
void read(T& n) {
  char ch;
  int sign = 1;
  while (!isdigit(ch = getchar()))
    if (ch == '-') sign = -1;
  n = ch - '0';
  while (isdigit(ch = getchar())) n = n * 10 + ch - '0';
  n *= sign;
}
const int INF = 1e9 + 7;
const int N = 122222;
int n, k, ans(1);
long double a[N], b[N], first[N];
struct edge {
  int to, nxt;
  long double k;
} g[N * 4];
int ghead[N], gtail(0);
void add(int l, int r, long double k) {
  g[++gtail] = (edge){r, ghead[l], k}, ghead[l] = gtail;
}
long double dfs(int first) {
  long double pos = 0, neg = 0;
  for (int p = ghead[first]; p; p = g[p].nxt) {
    int v = g[p].to;
    long double tmp = dfs(v);
    if (tmp < 0)
      neg -= tmp * g[p].k;
    else
      pos += tmp;
  }
  return a[first] + pos - b[first] - neg;
}
int main() {
  read(n);
  for (int i = (1); i <= (n); ++i) read(a[i]);
  for (int i = (1); i <= (n); ++i) read(b[i]);
  for (int i = (2); i <= (n); ++i) read(first[i]), read(k), add(first[i], i, k);
  puts(dfs(1) >= 0 ? "Yes" : "No");
  return 0;
}
