#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)

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 Q[MAXN], T[MAXN], in[MAXN], D[MAXN];

int deplaseaza(int srs, int dst, int cnt)
{
	int head, tail;

	vector <tlist_node>::iterator it;

	for (int i = 1; i <= N; ++ i) {
		T[i] = in[i] = 0;
		D[i] = INF;
	}
	D[srs] = 0;
	in[srs] = 1;
	for (Q[head = tail = 0] = srs; head <= tail; ++ head)
	{
		int x = Q[head];
		if (in[T[x]])  continue ;
		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] = D[x] + it->cst;
				Q[++ tail] = it->nod;
				T[it->nod] = x;
				in[it->nod] ++;
			}
		in[x] --;
	}
	return D[dst];
}		

int f(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 = f(t, i) + cnt * deplaseaza(P[i], P[p], cnt - 1);
			if (C[s][p] == -1 || C[s][p] > res)
				C[s][p] = res;
		}
	} else
		C[s][p] = deplaseaza(1, P[p], 0);

	return C[s][p];
}

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));

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

	return 0;
}