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>
const long long INF = (1ll << 62);
using namespace std;
inline long long read() {
  long long x = 0;
  int zf = 1;
  char ch = ' ';
  while (ch != '-' && (ch < '0' || ch > '9')) ch = getchar();
  if (ch == '-') zf = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * zf;
}
struct Edge {
  int to;
  long long dis;
  int next;
} edges[100005];
int head[100005], edge_num = 0;
inline void addEdge(int u, int v, long long dis) {
  edges[++edge_num] = (Edge){v, dis, head[u]};
  head[u] = edge_num;
}
long long a[100005], b[100005];
long long f[100005];
void DFS(int u) {
  f[u] = b[u] - a[u];
  for (int c_e = head[u]; c_e; c_e = edges[c_e].next) {
    int v = edges[c_e].to;
    DFS(v);
    if (f[v] < 0) {
      if (((long double)(INF) / edges[c_e].dis) <= f[v])
        f[u] = -INF;
      else
        f[u] += f[v] * edges[c_e].dis;
    } else {
      f[u] += f[v];
    }
  }
}
int main() {
  int n = read();
  for (int i = 1; i <= n; ++i) b[i] = read();
  for (int i = 1; i <= n; ++i) a[i] = read();
  for (int i = 2; i <= n; ++i) {
    int u = read();
    long long dis = read();
    addEdge(u, i, dis);
  }
  DFS(1);
  if (f[1] >= 0)
    printf("YES");
  else
    printf("NO");
  return 0;
}
