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;
mt19937 rnd(228);
const int N = 1e5 + 1;
vector<int> g[N];
long long b[N], a[N];
int k[N];
void dfs(int v, int pr) {
  for (int to : g[v]) {
    if (to != pr) {
      dfs(to, v);
    }
  }
  if (b[v] < a[v]) {
    if (pr == -1) {
      puts("NO");
      exit(0);
    }
    long long now = (a[v] - b[v]) * k[v];
    if (now / k[v] != (a[v] - b[v]) || now / (a[v] - b[v]) != k[v] ||
        now < max(a[v] - b[v], (long long)k[v])) {
      puts("NO");
      exit(0);
    }
    long long was = a[pr];
    a[pr] += now;
    if (a[pr] - now != was || a[pr] - was != now || a[pr] <= 0) {
      puts("NO");
      exit(0);
    }
  } else {
    if (pr != -1) {
      b[pr] += b[v];
      long long was = a[pr];
      a[pr] += a[v];
      if (a[pr] - a[v] != was || a[pr] - was != a[v] || a[pr] <= 0) {
        puts("NO");
        exit(0);
      }
    }
  }
  cout << v << ' ' << a[v] << ' ' << b[v] << endl;
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lld", &b[i]);
  for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
  for (int i = 1; i < n; i++) {
    int x;
    scanf("%d%d", &x, &k[i]);
    x--;
    g[x].push_back(i);
  }
  dfs(0, -1);
  puts("YES");
}
