#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 100000000000000000
struct SEG{
	ll seg[1<20];
	SEG(void){
		for(int i=0;i<1<<20;i++)seg[i]=INF;
	}
	void up(int a,ll x){
		a+=(1<<19)-1;
		seg[a]=x;
		while(a>0){
			a=(a-1)/2;
			seg[a]=min(seg[a*2+1],seg[a*2+2]);
		}
	}
	ll que(int a,int b,int l,int r,int k){
		if(b<l||r<a)return INF;
		if(a<=l&&r<=b)return seg[k];
		return min(que(a,b,l,(l+r-1)/2,k*2+1),que(a,b,(l+r+1)/2,r,k*2+2));
	}
};
ll n,x[300005],y[300005],a[300005],dp[300005];
SEG m,p;
int main(void){
    scanf("%lld",&n);
    for(int i=1;i<=n;i++)scanf("%lld",a+i);
    for(int i=1;i<=n;i++)scanf("%lld",x+i);
    for(int i=1;i<=n;i++)scanf("%lld",y+i);
    for(int i=1;i<=n;i++){
		m.up(i,dp[i-1]-x[i]+y[i]);
		p.up(i,dp[i-1]+x[i]+y[i]);
		int o=lower_bound(x,x+n+1,a[i])-x;
		dp[i]=m.que(1,min(i,o-1),0,(1<<19)-1,0)+a[i];
		if(o<=i)dp[i]=min(dp[i],p.que(o,i,0,(1<<19)-1,0))-a[i];
	}
	printf("%lld\n",dp[n]);
}