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 MAXN = 100 * 1000 + 10;
const long long MIN = 1000ll * 1000 * 1000 * 1000 + 100;
struct arc {
  long long fin, poids;
};
vector<arc> adj[MAXN];
long long val[MAXN];
bool vu[MAXN];
void faire(long long noeud) {
  vu[noeud] = true;
  for (auto arrete : adj[noeud]) {
    faire(arrete.fin);
    if (val[arrete.fin] > 0) {
      val[noeud] += val[arrete.fin];
    } else {
      val[noeud] += val[arrete.fin] * arrete.poids;
      if (val[noeud] <= -MIN) {
        cout << "NO" << endl;
        exit(0);
      }
    }
  }
}
int32_t main() {
  long long N;
  cin >> N;
  long long debut[N];
  long long fin[N];
  for (long long i = 0; i < N; i++) {
    cin >> debut[i];
  }
  for (long long i = 0; i < N; i++) {
    cin >> fin[i];
    val[i] = debut[i] - fin[i];
  }
  for (long long i = 1; i < N; i++) {
    long long a, b;
    cin >> a >> b;
    a--;
    adj[a].push_back({i, b});
  }
  for (long long i = 0; i < N; i++) {
    if (!vu[i]) {
      faire(i);
      if (val[i] < 0) {
        cout << "NO" << endl;
        return 0;
      }
    }
  }
  cout << "YES" << endl;
}
