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 = 100100;
const long long MOD = 1000000007;
const double EBS = 1e-7;
int dX[] = {0, 0, 1, -1};
int dY[] = {1, -1, 0, 0};
int n;
vector<pair<long long, long long> > adj[N];
long long a[N], b[N];
long long dfs(int cur) {
  for (auto x : adj[cur]) b[cur] += dfs(x.first);
  for (auto x : adj[cur])
    if (b[x.first] < a[x.first])
      b[cur] -= (a[x.first] - b[x.first]) * x.second, a[x.first] = b[x.first];
  long long cnt = 0;
  if (b[cur] > a[cur]) cnt = b[cur] - a[cur], a[cur] = b[cur];
  return cnt;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%lld", &b[i]);
  for (int i = 0; i < n; ++i) scanf("%lld", &a[i]);
  for (int i = 1; i < n; ++i) {
    int x, y;
    scanf("%d", &x);
    scanf("%d", &y);
    adj[--x].push_back({i, y});
  }
  dfs(0);
  if (b[0] >= a[0])
    puts("YES");
  else
    puts("NO");
  return 0;
}
