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 DocFile();
int XuLi();
const int infi = 2e9 + 1;
const int mod = 1e9 + 7;
const int maxn = 1e5;
const int N = maxn + 10;
typedef int mang[N];
typedef vector<int> mangv[N];
mangv a;
int n;
mang p, k;
mang cur, req;
int main() {
  DocFile();
  XuLi();
}
int DocFile() {
  scanf("%i", &n);
  for (int i = (int)(1); i <= (int)(n); i++) scanf("%i", &cur[i]);
  for (int i = (int)(1); i <= (int)(n); i++) scanf("%i", &req[i]);
  for (int i = (int)(2); i <= (int)(n); i++) {
    scanf("%i%i", &p[i], &k[i]);
    a[p[i]].push_back(i);
  }
}
int DFS(int u) {
  for (int i = (int)(0); i <= (int)(a[u].size() - 1); i++) DFS(a[u][i]);
  if (cur[u] > req[u]) cur[p[u]] += cur[u] - req[u];
  if (cur[u] < req[u]) cur[p[u]] -= k[u] * (req[u] - cur[u]);
}
int XuLi() {
  DFS(1);
  if (cur[1] >= req[1])
    cout << "YES";
  else
    cout << "NO";
}
