#include <cstdio>
#include <vector>
#include <set>
#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];

vector <int> dist[MAXN];

int source;

struct Functor {
	bool operator () (int i, int j) {
		return dist[source][i] < dist[source][j];
	}
} ;

multiset <int, Functor> Q;

vector <bool> inq;


void Dijkstra(int s, int cnt)
{
	vector <tlist_node>::iterator it;

	inq.assign(N + 1, false);
	dist[s].assign(N + 1, INF);
	dist[s][s] = 0;

	Q.insert(s);
	inq[s] = true;
	while (!Q.empty())
	{
		int x = *Q.begin();
		Q.erase(Q.begin());
		inq[x] = false;
		for (it = G[x].begin(); it != G[x].end(); ++ it) if (it -> cap >= cnt)
		{
			int y = it -> nod;
			if (dist[s][y] > dist[s][x] + (it -> cst))
			{
				if (inq[y])
					Q.erase(y);
				else
					inq[y] = true;
				dist[s][y] = dist[s][x] + (it -> cst);
				Q.insert(y);
			}
		}
	}
}	

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[P[i]][P[p]];
			if (C[s][p] == -1 || C[s][p] > res)
				C[s][p] = res;
		}
	} else
		C[s][p] = dist[1][P[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));

	for (int i = 1; i <= N; ++ i)
		dist[i].resize(N + 1);
	inq.resize(N + 1);
	for (int k = 1; k <= K; ++ k) {
		for (source = 1; source <= N; ++ source)
			Dijkstra(source, 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;
}