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 N = 1e5 + 9;
long long sum, a[N], b[N], x[N], k[N];
vector<pair<long long, long long> > g[N];
bool flag = 1;
inline long long read() {
  long long s = 1, a = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') s = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    a = a * 10 + ch - '0';
    ch = getchar();
  }
  return s * a;
}
inline void dfs(int u) {
  for (auto e : g[u]) {
    int k = e.first, v = e.second;
    dfs(v);
    if (b[v] > 0)
      b[u] += b[v];
    else {
      double w = 1.0 * b[v] * k;
      if (b[u] + w < -sum) flag = 0;
      b[u] += b[v] * k;
    }
  }
}
int main() {
  int n = read();
  for (int i = 1; i <= n; i++) b[i] = read(), sum += b[i];
  for (int i = 1; i <= n; i++) a[i] = read(), b[i] -= a[i];
  for (int i = 2; i <= n; i++) {
    int x = read(), k = read();
    g[x].push_back(make_pair(k, i));
  }
  dfs(1);
  return 0 * puts(flag & (b[1] >= 0) ? "YES" : "NO");
}
