import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

md = 10**9+7
# md = 998244353

from collections import deque

n=II()
aa=LI()
xx=LI()
yy=LI()

l=inf
r=deque()
dp=[0]+[inf]*n
j=0
for i in range(n):
    a,x,y=aa[i],xx[i],yy[i]
    v=dp[i]+x+y
    while r and r[-1][-1]>=v:r.pop()
    r.append((x,v))
    while r and r[0][0]<a:r.popleft()
    while j<=i and xx[j]<a:
        l=min(l,dp[j]+yy[j]-xx[j])
        j+=1
    dp[i+1]=l+a
    if r:dp[i+1]=min(dp[i+1],r[0][-1]-a)
print(dp[-1])