#include <bits/stdc++.h>
#include "bits/stdc++.h"
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <unordered_map>
#include <string.h>
#include <utility>

typedef long long ll;
const int INF = 1e8;

#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
using namespace std;

typedef pair<int, int> P;

int a[101];
int b[101];
int ans[101];

int main() {

	int n = 0;
	cin >> n;

	int tmp = 0;
	for (int i = 0; i < n; i++) {
		cin >> tmp;
		a[i] = tmp;
	}

	for (int i = 0; i < n; i++) {
		cin >> tmp;
		b[i] = tmp;
	}

	for (int i = 0; i < n; i++) {
		ans[b[i]] += a[i];
	}

	for(int i=1; i<n; i++){
			if(ans[0] < ans[i]){
				cout<<"NO"<<endl;
				return 0;
			}
		}

	cout<<"YES"<<endl;


	return 0;
}