#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#define rep(i,l,n) for(lint i=l;i<n;i++)
#define rer(i,l,n) for(lint i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define pb(a) push_back(a)
#define mk(a,b) make_pair(a,b)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef vector<int> vi;
typedef vector<lint> vli;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int main(){
	int n,sum=0,MAX=0;
	int d[101]={};
	cin>>n;
	vi a(n),b(n);
	rep(i,0,n) cin>>a[i];
	rep(i,0,n) cin>>b[i];
	rep(i,0,n){
		if(b[i]) d[b[i]]+=a[i];
		else sum+=a[i];
	}
	sort(d+1,d+101);
	reverse(d+1,d+101);
//	o(d[1]<<" "<<sum);
	if(d[1]<=sum) o("YES");
	else o("NO");
}