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 long long inf = 1e18;
long long n, a[100005], b[100005], fa[100005], k[100005];
vector<long long> edge[100005];
long long f[100005];
void dfs(long long x) {
  f[x] = a[x];
  for (long long i = 0; i < edge[x].size(); ++i) {
    long long v = edge[x][i];
    dfs(v);
    if (f[v] < 0)
      f[x] += max(1.0 * f[v] * k[v], -1e18);
    else
      f[x] += f[v];
    f[x] = max(f[x], -inf);
  }
}
signed main() {
  ios::sync_with_stdio(0);
  cin >> n;
  for (long long i = 1; i <= n; ++i) cin >> b[i];
  for (long long i = 1; i <= n; ++i) {
    cin >> a[i];
    a[i] = b[i] - a[i];
  }
  for (long long i = 2; i <= n; ++i) {
    cin >> fa[i] >> k[i];
    edge[fa[i]].push_back(i);
  }
  dfs(1);
  puts(f[1] >= 0 ? "YES" : "NO");
  return 0;
}
