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;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
long long a[100011], b[100011], k[100011];
int fa[100011];
int deep[100011];
vector<int> adj[100011];
priority_queue<pair<int, int>, vector<pair<int, int> >,
               greater<pair<int, int> > >
    pq;
void dfs(int u) {
  pq.push(pair<int, int>(-deep[u], u));
  for (int i = 0, v; i < ((int)adj[u].size()); i++) {
    v = adj[u][i];
    deep[v] = deep[u] + 1;
    dfs(v);
  }
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) gn(b[i]);
  for (int i = 1; i <= n; i++) {
    gn(a[i]);
    b[i] -= a[i];
  }
  for (int i = 2; i <= n; i++) {
    gn(fa[i]);
    gn(k[i]);
    adj[fa[i]].push_back(i);
  }
  dfs(1);
  while (!pq.empty()) {
    int u = pq.top().second;
    if (u == 1) break;
    pq.pop();
    if (b[u] > 0) {
      b[fa[u]] += b[u];
      continue;
    } else {
      if (b[u] and k[u] > 0x3f3f3f3f3f3f3f3fLL / (-b[u]) + 1) return puts("NO");
      b[fa[u]] += k[u] * b[u];
    }
  }
  if (b[1] >= 0)
    puts("YES");
  else
    puts("NO");
  return 0;
}
