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 int MAX_N = 100000 + 10;
class Int {
 public:
  static const int lenth = 10;
  static const long long base = 1000000;
  long long num[lenth];
  int sign;
  Int() {
    for (int i = 0; i < lenth; i++) {
      num[i] = 0;
    }
    sign = 0;
  }
  Int(long long x) {
    if (x == 0) {
      sign = 0;
    } else {
      if (x < 0) {
        sign = -1;
      } else {
        sign = 1;
      }
    }
    for (int i = 0; i < lenth; i++) {
      num[i] = 0;
    }
    num[0] = abs(x);
    relax();
  }
  void relax() {
    long long temp = 0;
    for (int i = 0; i < lenth; i++) {
      num[i] -= temp;
      temp = 0;
      if (num[i] < 0) {
        num[i] += base * base;
        temp += base;
      }
      if (i > 0) {
        num[i] += num[i - 1] / base;
        num[i - 1] %= base;
      }
    }
  }
  bool operator<(const Int& N) const {
    for (int i = lenth - 1; i >= 0; i--) {
      if (num[i] != N.num[i]) {
        return num[i] < N.num[i];
      }
    }
    return 0;
  }
  bool operator==(const Int& N) const {
    for (int i = 0; i < lenth; i++) {
      if (num[i] != N.num[i]) {
        return 0;
      }
    }
    return 1;
  }
  Int operator+(const Int& N) const {
    Int ret;
    if (*this == N) {
      if (sign == N.sign) {
        ret.sign = sign;
        for (int i = 0; i < lenth; i++) {
          ret.num[i] = num[i] + N.num[i];
        }
        ret.relax();
      }
    } else {
      if (*(this) < N) {
        if (sign == N.sign) {
          ret.sign = sign;
          for (int i = 0; i < lenth; i++) {
            ret.num[i] = num[i] + N.num[i];
          }
          ret.relax();
        } else {
          ret.sign = N.sign;
          for (int i = 0; i < lenth; i++) {
            ret.num[i] = N.num[i] - num[i];
          }
          ret.relax();
        }
      } else {
        if (sign == N.sign) {
          ret.sign = sign;
          for (int i = 0; i < lenth; i++) {
            ret.num[i] = num[i] + N.num[i];
          }
          ret.relax();
        } else {
          ret.sign = sign;
          for (int i = 0; i < lenth; i++) {
            ret.num[i] = num[i] - N.num[i];
          }
          ret.relax();
        }
      }
    }
    return ret;
  }
  Int operator-(const Int& N) const {
    Int ret;
    if (*this == N) {
      if (sign != N.sign) {
        ret.sign = sign;
        for (int i = 0; i < lenth; i++) {
          ret.num[i] = num[i] + N.num[i];
        }
        ret.relax();
      }
    } else {
      if (*(this) < N) {
        if (sign == N.sign) {
          ret.sign = sign * -1;
          for (int i = 0; i < lenth; i++) {
            ret.num[i] = N.num[i] - num[i];
          }
          ret.relax();
        } else {
          ret.sign = N.sign * -1;
          for (int i = 0; i < lenth; i++) {
            ret.num[i] = N.num[i] + num[i];
          }
          ret.relax();
        }
      } else {
        if (sign == N.sign) {
          ret.sign = sign;
          for (int i = 0; i < lenth; i++) {
            ret.num[i] = num[i] - N.num[i];
          }
          ret.relax();
        } else {
          ret.sign = sign;
          for (int i = 0; i < lenth; i++) {
            ret.num[i] = num[i] + N.num[i];
          }
          ret.relax();
        }
      }
    }
    return ret;
  }
};
int n;
long long a[MAX_N], b[MAX_N];
vector<pair<int, int> > G[MAX_N];
int degree[MAX_N];
Int dfs(int u, long long ratio = 1) {
  Int kilograms(b[u] - a[u]);
  for (int i = 0; i < G[u].size(); i++) {
    int v = G[u][i].first;
    long long Ratio = G[u][i].second;
    kilograms = kilograms + dfs(v, Ratio);
  }
  if (kilograms.sign < 0) {
    for (int i = 0; i < kilograms.lenth; i++) {
      kilograms.num[i] *= ratio;
    }
    kilograms.relax();
  }
  return kilograms;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &b[i]);
  }
  for (int i = 1; i <= n; i++) {
    scanf("%lld", &a[i]);
  }
  for (int i = 2; i <= n; i++) {
    int x, k;
    scanf("%d%d", &x, &k);
    G[x].push_back(pair<int, int>(i, k));
    degree[i]++;
  }
  int sw = 0;
  for (int i = 1; i <= n; i++)
    if (degree[i] == 0) {
      sw |= (((dfs(i)).sign >= 0) ? 0 : 1);
    }
  string ans = ((sw == 0) ? "YES" : "NO");
  printf("%s \n", ans.c_str());
}
