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 double PI = atan(1) * 4;
const int oo = 1000000000;
const int N = 1000010;
int n;
vector<int> g[N];
long long a[N], b[N], p[N], k[N], val[N];
void dfs(int u) {
  for (int i = 0; i < g[u].size(); ++i) {
    int v = g[u][i];
    dfs(v);
    if (val[v] < 0) {
      val[u] += k[v] * val[v];
    } else {
      val[u] += val[v];
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%lld", &b[i]);
  }
  for (int i = 1; i <= n; ++i) {
    scanf("%lld", &a[i]);
    val[i] = b[i] - a[i];
  }
  for (int i = 2; i <= n; ++i) {
    scanf("%lld%lld", &p[i], &k[i]);
    g[p[i]].push_back(i);
  }
  dfs(1);
  if (val[1] == 0) {
    puts("YES");
  } else {
    puts("NO");
  }
  return 0;
}
