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;
long long pwr(long long base, long long p, long long mod = (1000000007LL)) {
  long long ans = 1;
  while (p) {
    if (p & 1) ans = (ans * base) % mod;
    base = (base * base) % mod;
    p /= 2;
  }
  return ans;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
const int N = 100002;
int n;
long long have[N], need[N], multiplier[N];
vector<int> adj[N];
long long dfs(int v) {
  long long incoming = 0, outgoing = 0;
  if (need[v] < 0)
    incoming -= need[v];
  else
    outgoing += need[v];
  for (auto vv : adj[v]) {
    long long temp = dfs(vv);
    if (temp >= 0)
      incoming += temp;
    else
      outgoing -= multiplier[vv] * temp;
  }
  if (incoming >= outgoing) return incoming - outgoing;
  if (log2(multiplier[v]) + log2(outgoing - incoming) > 18.5) {
    printf("NO\n");
    exit(0);
  }
  return -(outgoing - incoming);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld", &have[i]);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &need[i]);
    need[i] -= have[i];
  }
  multiplier[1] = 1;
  for (int i = 2; i <= n; i++) {
    int par;
    scanf("%d%lld", &par, &multiplier[i]);
    adj[par].push_back(i);
  }
  if (dfs(1) >= 0)
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}
