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 = acos(-1.0);
double fRand(double fMin, double fMax) {
  double f = (double)rand() / RAND_MAX;
  return fMin + f * (fMax - fMin);
}
template <class T>
T min(T a, T b, T c) {
  return min(a, min(b, c));
}
template <class T>
T max(T a, T b, T c) {
  return max(a, max(b, c));
}
bool overflow(long long a, long long b) {
  return (a > 1000000000000000007LL / b);
}
int n;
long long a[100005], b[100005], dp[100005];
vector<pair<int, int> > g[100005];
void DFS(int u) {
  dp[u] = a[u] - b[u];
  for (pair<int, int> p : g[u]) {
    int v = p.first, k = p.second;
    DFS(v);
    if (dp[v] > 0) dp[u] += dp[v];
    if (dp[v] < 0) {
      if (overflow(-dp[v], k) || dp[u] + dp[v] * k < -1000000000000000007LL) {
        puts("NO");
        exit(0);
      }
      dp[u] += dp[v] * k;
    }
  }
}
int main() {
  scanf("%d", &n);
  for (int i = (1); i <= (n); ++i) scanf("%lld", &a[i]);
  for (int i = (1); i <= (n); ++i) scanf("%lld", &b[i]);
  for (int i = (2); i <= (n); ++i) {
    int x, k;
    scanf("%d%d", &x, &k);
    g[x].push_back(make_pair(i, k));
  }
  DFS(1);
  puts((dp[1] >= 0) ? "YES" : "NO");
  return 0;
}
