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<int> a[100010];
long long k[100010], A[100010], B[100010];
int fa, val;
long long dp[100010];
bool check(long long x, long long y) {
  double xx = 1.0 * x;
  double yy = 1.0 * y;
  if (xx * yy > 1000000000000000000.0) return 1;
  return 0;
}
void dfs(int x) {
  dp[x] = B[x] - A[x];
  for (int i = 0; i < int(a[x].size()); i++) {
    dfs(a[x][i]);
    dp[x] += dp[a[x][i]];
  }
  if (dp[x] < 0) {
    if (check(dp[x], k[x])) {
      printf("NO");
      exit(0);
    }
    dp[x] *= k[x];
  }
}
int n;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &B[i]);
  for (int i = 1; i <= n; i++) scanf("%d", &A[i]);
  for (int i = 2; i <= n; i++) {
    scanf("%d%d", &fa, &k[i]);
    a[fa].push_back(i);
  }
  k[1] = 1;
  dfs(1);
  if (dp[1] >= 0)
    printf("YES");
  else
    printf("NO");
}
