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 int N = 100001;
const long long int M = 1;
struct point {
  long long int x, y;
  long long int i;
};
void debug(stringstream &s) {}
template <typename T, typename... Args>
void debug(stringstream &s, T a, Args... args) {
  string word;
  s >> word;
  cout << word << " = " << a << endl;
  debug(s, args...);
}
long long int fast_exp(long long int x, long long int n) {
  if (n == 0)
    return 1;
  else if (n & 1)
    return fast_exp(x, n - 1) * x % 998244353;
  else {
    long long int tmp = fast_exp(x, n >> 1);
    return tmp * tmp % 998244353;
  }
}
vector<pair<int, long long int>> tree[N];
bool v[N];
long long int dfs(long long int x, long long int p, long long int a[],
                  long long int b[]) {
  if (v[x]) return 0;
  long long int ans = b[x] - a[x];
  v[x] = 1;
  for (auto i : tree[x]) {
    if (i.first != p) {
      long long int y = dfs(i.first, x, a, b);
      if (y < 0) {
        if (-y > (1e17 + i.second) / i.second) return -300000000000001;
        y = y * i.second;
      }
      ans += y;
    }
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int _ = 1;
  while (_--) {
    long long int n, m, x = 0, y, ans = 0, k;
    cin >> n;
    long long int a[n + 1], b[n + 1];
    a[0] = b[0] = 0;
    for (int i = 1; i <= n; i++) cin >> b[i];
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 2; i <= n; i++) {
      cin >> x >> y;
      tree[x].push_back({i, y});
    }
    if (dfs(1, 0, a, b) >= 0)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
  return 0;
}
