import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {

	public static void main(String[] args) {
		new Main().run();
	}

	class SegTree {
		int n;
		long[] val;

		public SegTree(int n_) {
			n = 1;
			while (n < n_)
				n *= 2;
			val = new long[2 * n - 1];
			Arrays.fill(val, Long.MAX_VALUE / 3);
		}

		void setVal(int k, long v) {
			k += n - 1;
			val[k] = v;
			while (k > 0) {
				k = (k - 1) / 2;
				val[k] = Math.min(val[2 * k + 1], val[2 * k + 2]);
			}
		}

		void addVal(int k, long v) {
			k += n - 1;
			val[k] += v;
			while (k > 0) {
				k = (k - 1) / 2;
				val[k] = Math.min(val[2 * k + 1], val[2 * k + 2]);
			}
		}

		long query(int a, int b, int l, int r, int k) {
			if (a <= l && r <= b) {
				return val[k];
			} else if (r <= a || b <= l) {
				return Long.MAX_VALUE / 3;
			} else {
				return Math.min(query(a, b, l, (l + r) / 2, 2 * k + 1), query(a, b, (l + r) / 2, r, 2 * k + 2));
			}
		}

		long query(int a, int b) {
			return query(a, b, 0, n, 0);
		}
	}

	public void run() {
		Scanner sc = new Scanner();
		int n = sc.nextInt();
		int[] a = new int[n];
		int[] x = new int[n];
		int[] y = new int[n];
		for (int i = 0; i < n; ++i)
			a[i] = sc.nextInt();
		for (int i = 0; i < n; ++i)
			x[i] = sc.nextInt();
		for (int i = 0; i < n; ++i)
			y[i] = sc.nextInt();
		long[] d = new long[n];
		Arrays.fill(d, Long.MAX_VALUE / 3);
		SegTree plus = new SegTree((int) 1e5 + 1);
		SegTree minus = new SegTree((int) 1e5 + 1);
		for (int i = 0; i < n; ++i) {
			plus.setVal(x[i], (i > 0 ? d[i - 1] : 0) - x[i] + y[i]);
//			minus.setVal(x[i], (i > 0 ? d[i - 1] : 0) + x[i] + y[i]);
			d[i] = Math.min(d[i], plus.query(0, a[i]) + a[i]);
			d[i] = Math.min(d[i], minus.query(a[i], (int) 1e5) - a[i]);
		}
		System.out.println(d[n - 1]);
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

	class Scanner {
		private final InputStream in = System.in;
		private final byte[] buffer = new byte[1024];
		private int ptr = 0;
		private int buflen = 0;

		private boolean hasNextByte() {
			if (ptr < buflen) {
				return true;
			} else {
				ptr = 0;
				try {
					buflen = in.read(buffer);
				} catch (IOException e) {
					e.printStackTrace();
				}
				if (buflen <= 0) {
					return false;
				}
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[ptr++];
			else
				return -1;
		}

		private boolean isPrintableChar(int c) {
			return 33 <= c && c <= 126;
		}

		private void skipUnprintable() {
			while (hasNextByte() && !isPrintableChar(buffer[ptr]))
				ptr++;
		}

		public boolean hasNext() {
			skipUnprintable();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (isPrintableChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			long n = 0;
			boolean minus = false;
			int b = readByte();
			if (b == '-') {
				minus = true;
				b = readByte();
			}
			if (b < '0' || '9' < b) {
				throw new NumberFormatException();
			}
			while (true) {
				if ('0' <= b && b <= '9') {
					n *= 10;
					n += b - '0';
				} else if (b == -1 || !isPrintableChar(b)) {
					return minus ? -n : n;
				} else {
					throw new NumberFormatException();
				}
				b = readByte();
			}
		}

		int nextInt() {
			return (int) nextLong();
		}
	}

}