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>
const long double PI = acos(-1);
const long double eps = 0.0000000001;
const long long INF = 1e17;
long long n, v[100005], fa[100005], k[100005];
std::vector<long long> son[100005];
long long dfs(long long now) {
  long long res = v[now];
  for (auto i : son[now]) {
    res += dfs(i);
    if (1.0l * res * k[now] < -INF) std::cout << "NO" << std::endl, exit(0);
  }
  return res < 0 ? res * k[now] : res;
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin >> n;
  for (long long i = 1; i <= n; ++i) std::cin >> v[i];
  for (long long i = 1; i <= n; ++i) {
    static long long tmp;
    std::cin >> tmp;
    v[i] -= tmp;
  }
  for (long long i = 2; i <= n; ++i) {
    std::cin >> fa[i] >> k[i];
    son[fa[i]].push_back(i);
  }
  k[1] = 1;
  std::cout << (dfs(1) >= 0 ? "YES" : "NO") << std::endl;
  return 0;
}
