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

import java.math.BigInteger;
import java.util.*;
import java.util.Scanner;

public class main {

    public static int par[];//=new int[n+10];
    public static BigInteger have[];//=new BigInteger[n+10];
    public static BigInteger k[];//=new BigInteger[n+10];
    public static BigInteger need[];//=new BigInteger[n+10];
    public static Vector<Vector<Integer> > child;//=new Vector<Vector<Integer> >();

    public static void solve(int u)
    {
        for (int v:child.elementAt(u))
        {
            solve(v);
        }
        if (u==1){return;}
        BigInteger diff=have[u].subtract(need[u]);
        have[par[u]]=have[par[u]].add(diff.multiply(k[u]));
        have[u]=need[u];
    }

    public static void main(String[] args) {
        Scanner in=new Scanner(System.in);
        int n=in.nextInt();
        par=new int[n+10];
        have=new BigInteger[n+10];
        k=new BigInteger[n+10];
        need=new BigInteger[n+10];
        child=new Vector<Vector<Integer> >();
        for (int i=0;i<=n;i++)
        {
            Vector<Integer> skorobogatova=new Vector<Integer>();
            child.add(skorobogatova);
        }
        for (int i=1;i<=n;i++)
            have[i] = BigInteger.valueOf(in.nextLong());
        for (int i=1;i<=n;i++)
            need[i] = BigInteger.valueOf(in.nextLong());
        for (int i=2;i<=n;i++)
        {
            par[i]=in.nextInt();
            k[i]=BigInteger.valueOf(in.nextLong());
            child.elementAt(par[i]).add(i);
        }
        solve(1);
        //System.out.println(have[1]);
        //System.out.println(need[1]);
        if (have[1].compareTo(need[1]) >= 0) {
            System.out.println("YES");
        }
        else
        {
            System.out.println("NO");
        }
    }
}