#include <bits/stdc++.h>
using namespace std;
void c_p_c() {}
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  a %= b;
  return gcd(b, a);
}
long long lcm(long long a, long long b) { return (a * 1LL * b) / gcd(a, b); }
const long long N = 2e5 + 5;
const long long INF = 1e9 + 5;
long long par[N], a[N], d[N];
long long parent(long long x) {
  return (par[x] == x ? x : par[x] = parent(par[x]));
}
void merge(long long x, long long y) { par[parent(x)] = parent(y); }
void solve() {
  long long n;
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
    par[i] = i;
  }
  for (long long i = 1; i <= n; i++) {
    cin >> d[i];
    if (i + d[i] <= n) merge(a[i], a[i + d[i]]);
    if (i - d[i] > 0) merge(a[i], a[i - d[i]]);
  }
  bool yes = true;
  for (long long i = 1; i <= n; i++) {
    yes &= (parent(i) == parent(a[i]));
  }
  cout << (yes ? "YES" : "NO") << "\n";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  c_p_c();
  long long tc = 1;
  for (long long t = 1; t <= tc; t++) {
    solve();
  }
  return 0;
}
