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 = 2e5;
const long long inf = 1e18;
long long a[N];
long long bal[N];
long long zn[N];
int n;
long long b[N];
long long limit;
long long mul(long long &x, long long y) {
  if (-x >= inf / y + ((inf % y) != 0))
    return -inf;
  else
    return x * y;
}
void add(long long &x, long long y) {
  x += y;
  if (x > inf) x = inf;
  if (x < -inf) x = -inf;
}
vector<int> ed[N];
void dfs(int x) {
  long long sum = a[x] - b[x];
  for (int j = 0; j < ed[x].size(); j++) {
    int to = ed[x][j];
    dfs(to);
    if (bal[to] < 0) add(sum, mul(bal[to], zn[to]));
  }
  for (int j = 0; j < ed[x].size(); j++) {
    int to = ed[x][j];
    if (bal[to] > 0) sum += bal[to];
  }
  bal[x] = sum;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) cin >> b[i];
  for (int i = 2; i <= n; i++) {
    int par, k;
    cin >> par >> k;
    ed[par].push_back(i);
    zn[i] = k;
  }
  dfs(1);
  if (bal[1] < 0)
    cout << "NO\n";
  else
    cout << "YES\n";
  return 0;
}
