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 long long mod = 1e9 + 7;
const double pi = acos(-1);
int n, i, j, k, t;
long double a[100004], b[100004], val[100003];
int x[100004], c[100003];
vector<int> adj[100005];
map<int, long double> mep[100005];
int par[100003];
bool bisa = true;
void getpar(int v, int p) {
  par[v] = p;
  for (int x : adj[v])
    if (x != p) getpar(x, v);
}
void dfs(int v, int p) {
  val[v] = b[v] - a[v];
  for (int x : adj[v]) {
    if (x != p) {
      val[v] += val[x] * mep[x][v];
    }
  }
  if (llabs(val[v]) > 1e17 / mep[v][p]) {
    puts("NO");
    exit(0);
  }
}
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; ++i) scanf("%Lf", b + i);
  for (i = 1; i <= n; ++i) scanf("%Lf", a + i);
  for (i = 2; i <= n; ++i) {
    scanf("%d %d", x + i, c + i);
    mep[x[i]][i] = c[i];
    mep[i][x[i]] = 1;
    adj[x[i]].push_back(i);
    adj[i].push_back(x[i]);
  }
  dfs(1, 1);
  puts(val[1] >= 0 ? "YES" : "NO");
  return 0;
}
