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 maxn = 100009;
vector<int> e[maxn];
long long b[maxn], a[maxn], fa[maxn], t[maxn];
long long n;
void dfs(int u, long long mx) {
  for (int i = 0; i < e[u].size(); i++) dfs(e[u][i], mx + b[u]);
  if (a[u] - b[u] > mx) {
    puts("NO");
    exit(0);
  }
  if (b[u] < a[u])
    b[fa[u]] -= t[u] * (a[u] - b[u]);
  else
    b[fa[u]] += b[u] - a[u];
}
int main() {
  scanf("%I64d", &n);
  for (int i = 1; i <= n; i++) scanf("%I64d", &b[i]);
  for (int i = 1; i <= n; i++) scanf("%I64d", &a[i]);
  for (int i = 2; i <= n; i++) {
    scanf("%I64d%I64d", &fa[i], &t[i]);
    e[fa[i]].push_back(i);
  }
  dfs(1, 0);
  puts(b[0] >= 0 ? "YES" : "NO");
  return 0;
}
