n = io.read("*n")
a, u = {}, {}
for i = 1, n do table.insert(a, io.read("*n")) end
for i = 1, n do
    z = io.read("*n")
    if(u[z] == nil) then u[z] = a[i] else u[z] = u[z] + a[i] end
end
rem = 0
max = 0
for k, v in pairs(u) do
    if(k == 0) then rem = v
    else
        max = math.max(max, v)
    end
end
if(max <= rem) then print("YES") else print("NO") end