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 MAX_N = 100000 + 10;
const long long inf = LONG_MAX;
int n;
long long a[MAX_N], b[MAX_N];
vector<pair<int, int> > G[MAX_N];
int degree[MAX_N];
long long dfs(int u, long long ratio = 1) {
  long long kilograms = b[u] - a[u];
  for (int i = 0; i < G[u].size(); i++) {
    int v = G[u][i].first;
    long long Ratio = G[u][i].second;
    kilograms += dfs(v, Ratio);
  }
  if (kilograms >= 0) {
    if (kilograms > inf) {
      printf("NO\n");
      exit(0);
    }
    return kilograms;
  } else {
    kilograms *= -1ll;
    if (kilograms > inf / ratio + 1ll) {
      printf("NO\n");
      exit(0);
    }
    kilograms = kilograms * ratio * -1ll;
    return kilograms;
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &b[i]);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
  }
  for (int i = 2; i <= n; i++) {
    int x, k;
    scanf("%d%d", &x, &k);
    G[x].push_back(pair<int, int>(i, k));
    degree[i]++;
  }
  for (int i = 1; i <= n; i++)
    if (degree[i] == 0) {
      if (dfs(i) < 0) {
        printf("NO\n");
        exit(0);
      }
    }
  printf("YES\n");
}
