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;
vector<pair<long double, long double> > adj[1000005];
static long long a[1000005], b[1000005];
pair<long double, long double> dfs(int cur) {
  pair<long double, long double> now = make_pair(0ll, 0ll);
  if (a[cur] > b[cur]) {
    now.first += (a[cur] - b[cur]);
  } else {
    now.second += (b[cur] - a[cur]);
  }
  for (int i = 0; i < adj[cur].size(); i++) {
    pair<long double, long double> tmp = dfs(adj[cur][i].first);
    tmp.second *= (adj[cur][i].second);
    now.first += tmp.first;
    now.second += tmp.second;
    assert(tmp.first == 0ll || tmp.second == 0ll);
  }
  long double x = min(now.first, now.second);
  now.second -= x;
  now.first -= x;
  return now;
}
int main() {
  if (0) {
    freopen("C:/Users/gold/Desktop/sublime IO/input.txt", "r", stdin);
    freopen("C:/Users/gold/Desktop/sublime IO/output.txt", "w", stdout);
  }
  int T = 1;
  while (T--) {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
      scanf("%lld", &a[i]);
    }
    for (int i = 1; i <= n; i++) {
      scanf("%lld", &b[i]);
    }
    for (int i = 0; i < n - 1; i++) {
      long long x, k;
      scanf("%lld %lld", &x, &k);
      adj[x].push_back(make_pair(i + 2.0, k * 1.0));
    }
    pair<long double, long double> ans = dfs(1);
    if (ans.second == 0ll) {
      puts("YES");
    } else {
      puts("NO");
    }
  }
  return 0;
}
