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 + 10;
const long long R = (long long)1e17 + 5;
int n;
long long a[N], b[N], f[N], g[N];
vector<pair<int, int> > adj[N];
long long Round(long long a, long long b) { return (a + b - 1) / b; }
void DFS(int u) {
  f[u] = max(0LL, a[u] - b[u]);
  g[u] = max(0LL, b[u] - a[u]);
  for (int k = 0; k < adj[u].size(); ++k) {
    int v = adj[u][k].first, w = adj[u][k].second;
    DFS(v);
  }
  for (int k = 0; k < adj[u].size(); ++k) {
    int v = adj[u][k].first, w = adj[u][k].second;
    if (f[v] >= Round(R - f[u], w))
      f[u] = R;
    else
      f[u] += f[v] * w;
    g[u] += g[v];
  }
  long long x = f[u], y = g[u];
  f[u] = max(0LL, x - y);
  g[u] = max(0LL, y - x);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%I64d", &b[i]);
  for (int i = 1; i <= n; ++i) scanf("%I64d", &a[i]);
  for (int i = 2; i <= n; ++i) {
    int p, k;
    scanf("%d%d", &p, &k);
    adj[p].push_back(pair<int, int>(i, k));
  }
  DFS(1);
  if (f[1] == 0)
    puts("YES");
  else
    puts("NO");
  return 0;
}
