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;
vector<pair<int, int>> e[100005];
long long a[100005], b[100005];
int n;
long long safemul(long long a, long long b) {
  double x = a * 1.0 * b;
  if (-4e18 < x && x < 4e18) {
    return a * b;
  } else if (x < 0) {
    return -4e18;
  } else {
    return 4e18;
  }
}
long long safeadd(long long a, long long b) {
  long long c = a + b;
  if (c < -4e18) {
    return -4e18;
  }
  if (c > 4e18) {
    return 4e18;
  }
  return c;
}
long long dfs(int x) {
  long long supply = 0;
  for (auto ee : e[x]) {
    long long r = dfs(ee.first);
    if (r > 0) {
      supply = safeadd(supply, r);
    } else {
      supply = safeadd(supply, safemul(r, ee.second));
    }
  }
  supply = safeadd(supply, b[x] - a[x]);
  return supply;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cerr.tie(nullptr);
  cin >> n;
  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++) {
    int x, k;
    cin >> x >> k;
    e[x].push_back({i, k});
  }
  long long r = dfs(1);
  if (r < 0) {
    cout << "NO\n";
  } else {
    cout << "YES\n";
  }
}
