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;

#define int long long

const int N = 1e5 + 2;

int n;
int a[N], b[N];
vector < pair < int, int > > adj[N];

#define ft first
#define nd second

void dfs(int u, int prev = 0, int prevCost = 0) {
    for(auto nxt : adj[u])
        dfs(nxt.ft, u, nxt.nd);
    if (b[u] < -2 * 1e17) {
        cout << "NO";
        exit(0);
    }
    if (!prev) return ;
    if (b[u] >= a[u]) b[prev] += b[u] - a[u];
    else {
        long double k = (long double) 1e18 / (long double) prevCost;
        if (k < a[u] - b[u]) {
            cout << "NO";
            exit(0);
        }
        b[prev] -= prevCost * (a[u] - b[u]);
    }
    //cout << u << ' ' << prev << ' ' << prevCost << ' ' << b[prev] << '\n';
}
main() {
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

    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 xi, ki; cin >> xi >> ki;
        adj[xi].push_back({i, ki});
    }
    dfs(1);
    cout << (b[1] >= a[1] ? "YES" : "NO");
}
