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;
int N;
long long a[100005], b[100005];
struct Edge {
  int v, k;
  Edge(int v = 0, int k = 0) : v(v), k(k) {}
};
vector<Edge> adj[100005];
void dfs(int u) {
  for (int v, w, k = 0; k < adj[u].size(); k++) {
    v = adj[u][k].v;
    w = adj[u][k].k;
    dfs(v);
    if (b[v] >= a[v])
      b[u] += b[v] - a[v];
    else {
      if (((long long)(1e15) + a[u]) / w <= a[v] - b[v])
        b[1] = -(long long)(1e15);
      else
        b[u] -= w * (a[v] - b[v]);
    }
  }
}
int main() {
  cin >> N;
  for (int i = 1; i <= N; i++) cin >> b[i];
  for (int i = 1; i <= N; i++) cin >> a[i];
  for (int u, k, v = 2; v <= N; v++) {
    cin >> u >> k;
    adj[u].push_back(Edge(v, k));
  }
  dfs(1);
  if (b[1] >= a[1])
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
