// O( K*N*M + K^2 * 2^K )
#include <cstdio>
#include <queue>
#include <vector>
#include <algorithm>

using namespace std;

#define PB push_back

const int INF = 0x3f3f3f3f;
const int NMAX = 1024;
const int KMAX = 16;

struct edge {
	int v, c, d;
	edge(int _v = 0, int _c = 0, int _d = 0) : v(_v), c(_c), d(_d) {}
	bool operator<(const edge &a) const {
		return d > a.d;
	}
};

int K, N, M;
int P[KMAX];
vector <edge> G[NMAX];
int Dist[KMAX][KMAX][KMAX];
bool B[KMAX][1 << KMAX];
int O[KMAX][1 << KMAX];

void read(void) {
	FILE *fin = fopen("gather.in", "rt");
	int i, a, b;
	int c ,d;

	fscanf(fin, " %d %d %d", &K, &N, &M);

	for (i = 0; i < K; ++i)
		fscanf(fin, " %d", &P[i]);

	for (i = 0; i < M; ++i) {
		fscanf(fin, " %d %d %d %d", &a, &b, &c, &d);

		G[a].PB( edge(b, c, d) );
		G[b].PB( edge(a, c, d) );
	}

	fclose(fin);
}

void bellmanFord(void) {
	int i, j, k, u;
	vector <edge> :: iterator it;
	bool V[NMAX];
	int D[NMAX];
	queue <int> Q;

	for (i = 1; i <= N; ++i)
		sort(G[i].begin(), G[i].end());

	P[K] = 1;
	for (i = 0; i <= K; ++i) {
		
		memset(D, 0x3f, sizeof(D));

		D[P[i]] = 0;

		for (j = K; j >= 0; --j) {
			
			for (k = 1; k <= N; ++k)
				V[k] = true,
				Q.push(k);

			for (; !Q.empty(); Q.pop()) {
				u = Q.front();
				V[u] = false;

				for (it = G[u].begin(); it != G[u].end() && it->d >= j; ++it) {
					if (D[u] + it->c >= D[it->v])
						continue;
					D[it->v] = D[u] + it->c;

					if (V[it->v] == true)
						continue;

					V[it->v] = true;
					Q.push(it->v);

				}
			}

			for (k = 0; k < K; ++k) 
				if (D[P[k]] != INF)
					Dist[j][i][k] = D[P[k]] * (j + 1);
				else
					Dist[j][i][k] = INF;
		}

	}
}

int solve(int k, int cnf, int mlt) {
	if (mlt == 0)
		return Dist[0][K][k];
	if (B[k][cnf] == true)
		return O[k][cnf];
	
	int i;
	int rez = INF, t;

	for (i = 0; i < K; ++i)
		if (cnf & (1 << i)) {
			t = solve(i, cnf & ~(1 << i), mlt - 1);
			t += Dist[mlt][k][i];
			rez = min(rez, t);
		}

	B[k][cnf] = true;
	return O[k][cnf] = rez;
}

void write(void) {
	FILE *fout = fopen("gather.out", "wt");
	int i, rez, d;

	for (i = 0; i < K; ++i)
		rez = min(rez, solve(i, (1 << K) - 1, K));

	d = -1;
//	printf("%u\n", d);

	if (rez > d)
		return;

	fprintf(fout, "%d\n", rez);

	fclose(fout);
}

int main(void) {

	read();

	bellmanFord();

	write();

	return 0;
}