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 MOD = 1000000007, MOD2 = 1000000009;
const int INF = 0x3f3f3f3f;
const long long BINF = 0x3f3f3f3f3f3f3f3fLL;
int n;
long long demand[100005], supply[100005];
vector<pair<int, long long> > g[100005];
void dfs(int u, int p = -1) {
  if (supply[u] < demand[u])
    demand[u] = demand[u] - supply[u], supply[u] = 0;
  else
    supply[u] = supply[u] - demand[u], demand[u] = 0;
  for (auto e : g[u]) {
    int v = e.first;
    if (v - p) {
      dfs(v, u);
      if (demand[v] > 4e18 / e.second) cout << "NO" << endl, exit(0);
      long long wow = demand[v] * e.second;
      if (demand[u] + wow > 4e18) cout << "NO" << endl, exit(0);
      demand[u] += wow;
      supply[u] += supply[v];
    }
  }
  if (supply[u] < demand[u])
    demand[u] = demand[u] - supply[u], supply[u] = 0;
  else
    supply[u] = supply[u] - demand[u], demand[u] = 0;
}
int solve() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> supply[i];
  for (int i = 0; i < n; i++) cin >> demand[i];
  for (int i = 1; i < n; i++) {
    int p;
    long long hi;
    cin >> p >> hi;
    p--;
    g[p].push_back({i, hi});
  }
  dfs(0);
  cout << (demand[0] > 0 ? "NO" : "YES") << endl;
  return 0;
}
int main() {
  ios::sync_with_stdio(0);
  solve();
  return 0;
}
