#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
#define mp make_pair
#define f first
#define s second
#define nmax 760
#define lmax 32800
#define inf 1<<30

vector <pair <int, pair <int, int> > > g[nmax];
int k, n, m, v[22][22][22], p[22], a[lmax][22], nr[lmax], sol, d[nmax];
queue <int> q;

void bellman_ford(int nod, int dmax)
{
	int i, v;
	for (i=1; i<=n; i++) d[i]=inf;
	d[nod]=0;
	q.push(nod);
	while (!q.empty())
	{
		nod=q.front();
		q.pop();
		for (i=0; i<g[nod].size(); i++)
			if (g[nod][i].s.s>=dmax)
			{
				v=g[nod][i].f;
				if (d[nod]+g[nod][i].s.f<=d[v])
				{	
					d[v]=d[nod]+g[nod][i].s.f;
					q.push(v);
				}
			}
	}
}

int main()
{
	freopen("gather.in","r",stdin);
	freopen("gather.out","w",stdout);
	scanf("%d %d %d", &k, &n, &m);
	int i, j, x, y, z, t, cnf, cnfi;
	for (i=1; i<=k; i++) scanf("%d", &p[i]);
	p[0]=1;
	for (i=1; i<=m; i++)
	{
		scanf("%d %d %d %d", &x, &y, &z, &t);
		t++;
		g[x].push_back(mp(y, mp(z,t)));
		g[y].push_back(mp(x, mp(z,t)));
	}
	for (i=0; i<=k; i++)
		for (j=1; j<=k+1; j++)
		{
			bellman_ford(p[i], j);
			for (y=0; y<=k; y++) v[i][j][y]=d[p[y]];
		}
	for (cnf=0; cnf<(1<<k); cnf++)
		for (i=0; i<=k; i++) a[cnf][i]=inf;
	for (cnf=1; cnf<(1<<k); cnf++)
		nr[cnf]=nr[cnf>>1]+(cnf&1);
	for (cnf=0; cnf<(1<<k); cnf++) nr[cnf]++;
	a[0][0]=0;
	for (cnf=1; cnf<(1<<k); cnf++)
		for (i=1; i<=k; i++)
			if (cnf & (1<<(i-1)))
				for (j=0; j<=k; j++)
					if (i!=j)
					{
						cnfi=cnf-(1<<(i-1));
						a[cnf][i]=min(a[cnf][i], a[cnfi][j]+v[j][nr[cnfi]][i]*nr[cnfi]);
					}
	cnf=(1<<k)-1;
	sol=inf;
	for (i=1; i<=k; i++) sol=min(sol, a[cnf][i]);
	printf("%d\n",sol);
}