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 <iostream>
#include <cstdio>
#include <algorithm>
#include <fstream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <iomanip>

using namespace std;

const int inf = 2e9 + 88;
const int maxn = 1e5 + 88;
const int maxa = 1e6 + 88;
const long long llinf = 1e18 + 88;
const double PI = acos(-1);
const double eps = 1e-9;

struct _edge
{
    int to, c, f;
};

int readd()
{
    int cur;
    scanf("%d", &cur);
    return cur;
}

long long readl()
{
    long long cur;
    scanf("%I64d", &cur);
    return cur;
}

double readf()
{
    double cur;
    scanf("%f", &cur);
    return cur;
}

bool ans = true;
long long a[maxn], b[maxn];
vector<_edge> g[maxn];

void add(int v, int d, long long c, int f)
{
    if (f == 0)
        c = 1;
    long long cur = d*c;
    if (cur == 0)
        return;
    if (cur/d != c || cur < -llinf)
    {
        ans = false;
        return;
    }
    b[v] += cur;
    if (b[v] < -llinf)
    {
        ans = false;
        return;
    }
}

void dfs(int v, int p, long long c, int f)
{
    int i;
    for (i = 0; i < g[v].size() && ans; i++)
    {
        int to = g[v][i].to;
        if (to != p)
            dfs(to, v, g[v][i].c, g[v][i].f);
    }
    if (v == 0)
    {
        if (b[v] < a[v])
            ans = false;
        return;
    }
    if (b[i] < -llinf)
    {
        ans = false;
        return;
    }
    long long d = b[v] - a[v];
    if (d > 0)
        f ^= 1;
    add(p, d, c, f);
}

int main()
{
//    ios_base::sync_with_stdio(0);
//    ifstream cin("circle.in");
//    ofstream cout("circle.out");
//    freopen("", "r", stdin);
//    freopen("", "w", stdout);
    int n = readd(), i;
    for (i = 0; i < n; i++)
        b[i] = readl();
    for (i = 0; i < n; i++)
        a[i] = readl();
    for (i = 1; i < n; i++)
    {
        long long x = readl(), k = readl();
        x--;
        g[i].push_back({x, k, 0});
        g[x].push_back({i, k, 1});
    }
    dfs(0, -1, -1, -1);
    if (ans)
        printf("YES");
    else
        printf("NO");
    return 0;
}
