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 = 1e5 + 5;
vector<pair<int, long long> > G[N];
vector<int> aG[N];
long long ned[N], now[N];
int in[N];
bool vis[N];
void dfs(int rt, int f) {
  vis[rt] = true;
  for (pair<int, long long> v : G[rt]) {
    dfs(v.first, f);
  }
  for (pair<int, long long> e : G[rt]) {
    int v = e.first;
    if (now[v] >= ned[v]) {
      long long tmp = now[v] - ned[v];
      now[rt] += tmp;
      now[v] -= tmp;
    } else {
      long long tmp = ned[v] - now[v];
      now[rt] -= tmp * e.second;
      now[v] += tmp;
    }
  }
}
bool bfs(int rt) {
  if (vis[rt]) return true;
  queue<int> q;
  vis[rt] = 1;
  q.push(rt);
  long long sum = now[rt], totned = ned[rt];
  while (!q.empty()) {
    int u = q.front();
    q.pop();
    for (int v : aG[u]) {
      if (vis[v]) continue;
      vis[v] = 1;
      q.push(v);
      sum += now[v];
      totned += ned[v];
    }
  }
  return sum >= totned;
}
int main(int argc, const char* agrv[]) {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%lld", now + i);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%lld", ned + i);
  }
  int x;
  long long k;
  for (int i = 2; i <= n; ++i) {
    scanf("%d %lld", &x, &k);
    G[x].push_back(pair<int, long long>(i, k));
    aG[i].push_back(x);
  }
  dfs(1, 1);
  bool ans = true;
  if (now[1] < ned[1]) ans = false;
  for (int i = 1; i <= n; ++i) {
    if (!bfs(i)) ans = false;
  }
  if (ans)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
