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 + 5;
const long long M = 1e9 + 7;
long long avl[N], req[N], x[N], k[N], need[N];
long long power(long long b, long long p) {
  long long res = 1;
  for (int i = 1; i <= p; i++) res *= b;
  return res;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &avl[i]);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &req[i]);
    need[i] = avl[i] - req[i];
  }
  for (int i = 2; i <= n; i++) {
    scanf("%lld", &x[i]);
    scanf("%lld", &k[i]);
  }
  for (int i = n; i > 0; i--) {
    int to = x[i];
    if (need[i] == 0) continue;
    if (need[i] > 0) {
      need[to] += need[i];
    } else {
      int flag = 0;
      for (int j = 1; j < 10; j++) {
        long long tk = power(10, j);
        if (tk > k[i]) break;
        long long tn = power(10, 14 - j);
        tn *= (-1);
        if (need[i] < tn) {
          flag = 1;
          break;
        }
      }
      if (flag) {
        printf("NO\n");
        return 0;
      }
      need[to] += k[i] * need[i];
    }
    if (need[to] < -1e15) {
      printf("NO\n");
      return 0;
    }
  }
  if (need[1] >= 0)
    printf("YES\n");
  else
    printf("NO\n");
}
