using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using SB = System.Text.StringBuilder;
using System.IO;
using Number = System.Int64;
namespace Program {
    public class Solver {


        public void Solve() {
            var D = rl;
            var n = ri;
            var s = Enumerate(n, x => rl);
            var m = ri;
            var d = Enumerate(m, x => rl);
            var min = long.MaxValue;
            var pair = new List<int>();
            for (int i = 0; i < n; i++)
                for (int j = i + 1; j < n; j++)
                    pair.Add(i * n + j);
            Action<int, bool[][], int[]> rec = null;
            rec = (id, used, pos) => {
                if (id == pair.Count) {
                    var g = Enumerate(n, x => new long[n]);
                    for (int i = 0; i < n; i++)
                        for (int j = i + 1; j < n; j++)
                            g[i][j] = g[j][i] = INF;
                    for (int i = 0; i < n - 1; i++)
                        g[i + 1][i] = -1;
                    for (int iid = 0; iid < pos.Length; iid++) {
                        var i = pair[iid] / n;
                        var j = pair[iid] % n;
                        var k = pos[iid];
                        if (k == m) {
                            g[j][i] = Math.Min(g[j][i], D * (s[j] - s[i]));
                        }
                        else {
                            g[i][j] = Math.Min(g[i][j], d[k] * (s[i] - s[j]));
                            g[j][i] = Math.Min(g[j][i], d[k] * (s[j] - s[i]));
                        }
                    }
                    for (int k = 0; k < n; k++)
                        for (int i = 0; i < n; i++)
                            for (int j = 0; j < n; j++)
                                g[i][j] = Math.Min(g[i][j], g[i][k] + g[k][j]);
                    if (g[0].Min() >= 0) {
                        var max = 0L;
                        for (int i = 0; i < n; i++)
                            max = Math.Max(max, D * s[i] + g[n - 1][i] - g[n - 1][0]);
                        var ok = true;
                        for (int iid = 0; iid < pos.Length; iid++) {
                            var i = pair[iid] / n;
                            var j = pair[iid] % n;
                            var k = pos[iid];
                            if (k != m) {
                                ok &= g[i][j] == d[k] * (s[i] - s[j]);
                                ok &= g[j][i] == d[k] * (s[j] - s[i]);
                            }
                        }
                        if (ok)
                            min = Math.Min(min, max);
                    }

                    return;
                }
                var a = pair[id] / n;
                var b = pair[id] % n;
                for (int j = 0; j <= m; j++) {
                    if (j < m && used[a][j]) continue;
                    if (j < m && used[b][j]) continue;
                    pos[id] = j;
                    used[a][j] = true;
                    used[b][j] = true;
                    rec(id + 1, used, pos);
                    used[b][j] = false;
                    used[a][j] = false;
                    pos[id] = -1;
                }
            };
            rec(0, Enumerate(n, x => new bool[m + 1]), new int[pair.Count]);
            Console.WriteLine(min);
        }


        const long INF = 1L << 60;
        //int[] dx = { -1, 0, 1, 0 };
        //int[] dy = { 0, 1, 0, -1 };
        //*
        int ri { get { return sc.Integer(); } }
        long rl { get { return sc.Long(); } }
        double rd { get { return sc.Double(); } }
        string rs { get { return sc.Scan(); } }
        //*/

        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex {
    static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
        return string.Join(st, ie.Select(x => x.ToString()).ToArray());
        //return string.Join(st, ie);
    }
    static public void Main() {
        Console.SetOut(new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Program.Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO {
    using System.IO;
    using System.Text;
    using System.Globalization;
    public class Printer: StreamWriter {
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
    }
    public class StreamScanner {
        public StreamScanner(Stream stream) { str = stream; }
        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }
        private byte read() {
            if (isEof) return 0;
            if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
            return buf[ptr++];
        }
        public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; }

        public string Scan() {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine() {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n' && b != 0; b = (char)read())
                if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
        public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
        public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
}
#endregion


Measured memory_bytes: 9800