#include <cstdio>
#include <vector>
#include <memory.h>

using namespace std;

const char iname[] = "gather.in";
const char oname[] = "gather.out";

#define MAXK  16
#define MAXSTATE  1 << MAXK
#define MAXN  755
#define INF   int(1e9)
#define swap(a, b) ((a) ^= (b) ^= (a) ^= (b))

int K, N, M;

int C[MAXSTATE][MAXK], P[MAXK];

struct tlist_node {
	int nod, cst, cap;
	void update(int nod, int cst, int cap) {
		this->nod = nod;
		this->cst = cst;
		this->cap = cap;
	}
} ;

vector <tlist_node> G[MAXN];

int dist[MAXK][MAXK], Q[MAXN], D[MAXN];


void BellmanFord(int k, int s, int cnt)
{
	int h, t;

	vector <tlist_node>::iterator it;

	memset(D, -1, sizeof(D));
	D[s] = 0;
	for (Q[h = t = 0] = s; h <= t; ++ h)
	{
		int x = Q[h];
		for (it = G[x].begin(); it != G[x].end(); ++ it) if (it->cap >= cnt)
			if (D[it->nod] > D[x] + it->cst || D[it->nod] == -1) {
				D[it->nod] = D[x] + it->cst;
				Q[++ t] = it->nod;
			}
	}
	for (int i = 0; i < K; ++ i)
		dist[k][i] = D[P[i]];
}		

int g(int s, int p)
{
	if (C[s][p] != -1)	return C[s][p];

	if (s & (s - 1)) 
	{	// sunt cel putin doi detinuti
		int cnt = 0;
		for (int i = 0; i < K; ++ i) if ((s >> i) & 1)
			cnt ++;
		int t = s ^ (1 << p);
		for (int i = 0; i < K; ++ i) if ((t >> i) & 1)
		{
			int res = g(t, i) + cnt * dist[i][p];
			if (C[s][p] == -1 || C[s][p] > res)
				C[s][p] = res;
		}
	} else
		C[s][p] = dist[K][p];

	return C[s][p];
}

void f(int s, int k, int n)
{
	if (n == 0) {
		for (int i = 0; i < K; ++ i) if ((s >> i) & 1)
			g(s, i);
	} else {
		if (K - k > n)
			f(s, k + 1, n);
		f(s | (1 << k), k + 1, n - 1);
	}
}

int main(void)
{
	freopen(iname, "r", stdin);
	freopen(oname, "w", stdout);

	int x, y, cst, cap;
	
	scanf("%d %d %d", &K, &N, &M);
	for (int i = 0; i < K; ++ i)
		scanf("%d", &P[i]);
	tlist_node t;
	for (int i = 0; i < M; ++ i) {
		scanf("%d %d %d %d", &x, &y, &cst, &cap);
		t.update(y, cst, cap);
		G[x].push_back(t);
		t.update(x, cst, cap);
		G[y].push_back(t);
	}
	memset(C, -1, sizeof(C));

	P[K] = 1;
	for (int k = 1; k <= K; ++ k) {
		for (int i = 0; i <= K; ++ i)
			BellmanFord(i, P[i], k - 1);
		f(0, 0, k);
	}

	int ans = -1;

	for (int i = 0; i < K; ++ i) {
		if (ans == -1 || ans > C[(1 << K) - 1][i])
			ans = C[(1 << K) - 1][i];
	}
	printf("%d\n", ans);

	return 0;
}