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 = 5e5 + 15;
const long long inf = -4e18;
long long value[N];
vector<pair<int, long long> > adj[N];
long long convert(long long x, long long k) {
  if (x >= 0) return x;
  if (abs(x) <= abs(inf) / k) {
    return x * k;
  } else {
    return inf;
  }
}
long long add(long long x, long long y) { return max(x + y, inf); }
long long dfs(int node) {
  long long &ret = value[node];
  for (pair<int, long long> edge : adj[node]) {
    ret = add(ret, convert(dfs(edge.first), edge.second));
  }
  return ret;
}
void solve() {
  int n;
  scanf("%d ", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%lld ", &value[i]);
  }
  for (int i = 1; i <= n; ++i) {
    long long a;
    scanf("%lld ", &a);
    value[i] -= a;
  }
  for (int i = 2; i <= n; ++i) {
    int p;
    long long w;
    scanf("%d %lld ", &p, &w);
    adj[p].push_back({i, w});
  }
  if (dfs(1) >= 0) {
    printf("YES\n");
  } else {
    printf("NO\n");
  }
}
int main() {
  solve();
  return 0;
}
