#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<string>
#include<sstream>
#include<cmath>
using namespace std;

int main(){

  int n;
  cin >> n;
  vector<int> a(n);
  vector<int> b(n);
  for(int i=0; i<n; i++) cin >> a[i];
  for(int i=0; i<n; i++) cin >> b[i];

  int t = *max_element(b.begin(), b.end());
  if( t == 0 ){
    cout << "YES" << endl;
    return 0;
  }
  vector<int> h( t, 0 );

  int c = 0;
  for(int i=0; i<n; i++){
    if( b[i] != 0 ) h[ b[i] ] += a[i];
    else c += a[i];
  }

  if( *max_element(h.begin(), h.end()) <= c ) cout << "YES" << endl;
  else cout << "NO" << endl;

  return 0;
}