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;
vector<long long> graph[100001];
long long a[100001], b[100001];
long long k[100001];
bool flag = 0;
void dfs(long long src, long long par) {
  for (long long i = 0; i < graph[src].size(); i++) {
    if (graph[src][i] != par) dfs(graph[src][i], src);
  }
  if (src == 1) return;
  if (b[src] > a[src]) {
    long long baki = b[src] - a[src];
    b[par] = b[par] + baki;
    b[src] = a[src];
  } else if (b[src] < a[src]) {
    long long lagbe = a[src] - b[src];
    if (k[src] > ((1000000000000000000 + b[par]) / lagbe)) {
      flag = 1;
      return;
    }
    lagbe = lagbe * k[src];
    b[par] = b[par] - lagbe;
    b[src] = a[src];
  }
}
int main() {
  long long n;
  scanf("%lld", &n);
  for (long long i = 1; i <= n; i++) scanf("%lld", &b[i]);
  for (long long i = 1; i <= n; i++) scanf("%lld", &a[i]);
  for (long long i = 2; i <= n; i++) {
    long long x;
    scanf("%lld", &x);
    graph[i].push_back(x);
    graph[x].push_back(i);
    scanf("%lld", &x);
    k[i] = x;
  }
  dfs(1, 0);
  if (flag)
    printf("NO");
  else {
    if (b[1] >= a[1])
      printf("YES");
    else
      printf("NO");
  }
}
