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 MOD = 1e9 + 7;
const int maxn = 1e5 + 100;
long long a[maxn], b[maxn], k[maxn];
int x[maxn];
vector<int> G[maxn];
int n;
void dfs(int pos = 1) {
  for (int i = 0; i < G[pos].size(); ++i) {
    int v = G[pos][i];
    dfs(v);
    if (a[v] < 0) {
      a[pos] += k[v] * a[v];
      a[v] = 0;
    } else {
      a[pos] += a[v];
      a[v] = 0;
    }
  }
}
bool check() {
  for (int i = 1; i <= n; ++i)
    if (a[i] < 0) return false;
  return true;
}
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]);
    a[i] = b[i] - a[i];
  }
  for (int i = 2; i <= n; ++i) {
    scanf("%d%lld", &x[i], &k[i]);
    G[x[i]].push_back(i);
  }
  dfs();
  if (check())
    printf("YES\n");
  else {
    printf("NO\n");
  }
  return 0;
}
