#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
#include <memory.h>

#define ll long long
#define newn G[x][i]
#define oo (1LL << 60)
#define Unu(conf, poz) ((1 << poz) & (conf))
#define Out(conf, poz) ((1 << poz) ^ (conf))

using namespace std;

ifstream fin("gather.in");
ofstream fout("gather.out");

const int Nmax = 755;
const int Kmax = 17;
const int Mmax = 1255;
const int Conf = (1 << 16);

struct graf{
    ll nod, dist, cap;
};

typedef pair <ll, int> nod;


int K, N, M, CEL[Kmax], Nr[Conf + 1];
vector <graf> G[Nmax];
vector <bool> inq(Nmax);
ll Dist[Nmax][Kmax][Kmax], DP[Conf + 1][Kmax];
priority_queue <nod, vector<nod>, greater<nod> > q;

void Dijkstra(const int S, const int poz, const ll Cap)
{
    for(int i=0; i <= N + 1; i++)
        Dist[i][poz][Cap] = oo;

    Dist[S][poz][Cap] = 0;
    inq.assign(N + 1, 0); inq[S] = 1;
    q.push(nod(0, S));

    while(!q.empty())
    {
        ll x = q.top().second; q.pop();
        for(size_t i = 0; i < G[x].size(); i++)
        {
            if(newn.cap >= Cap)
                if(Dist[newn.nod][poz][Cap] > Dist[x][poz][Cap] + newn.dist)
                {
                    Dist[newn.nod][poz][Cap] = Dist[x][poz][Cap] + newn.dist;
                    if(!inq[newn.nod]) inq[newn.nod] = 1, q.push(nod(Dist[newn.nod][poz][Cap], newn.nod));
                }
        }
    }
    //cout<<Dist[1][poz][Cap]<<endl;
}

int main()
{
    fin >> K >> N >> M;
    for(int i = 0; i < K; i++)
        fin>>CEL[i];
    CEL[K] = 1;
    int Confm = (1 << K);

    for(int i = 1; i <= M; i++)
    {
        ll x, y, dist, cap;
        fin>>x>>y>>dist>>cap;
        graf g; g.nod = y; g.dist = dist; g.cap = cap;
        G[x].push_back(g); g.nod = x;
        G[y].push_back(g);
    }

    for(int i=0; i <= K; i++)
        for(int j=0; j <= K; j++)
            Dijkstra(CEL[i], i, j);

    for(int conf = 1; conf < Confm; conf++)
        Nr[conf] = Nr[(conf & (conf -1))] + 1;

    for(int conf = 0; conf < Confm; conf++)
        for(int i = 0; i < K; i++)
            DP[conf][i] = oo;

    for(int conf = 1; conf < Confm; conf++)
        if(!(conf & (conf -1)))
        {
            int i;
            for(i=0; !Unu(conf, i); i++);
            DP[conf][i] = Dist[CEL[i]][K][0];
        }
        else
            for(int i=0; i < K; i++)
                if(Unu(conf, i))
                    for(int j = 0; j < K ; j++)
                        if(i != j && Unu(conf, j) &&  DP[Out(conf, i)][j] != oo && Dist[CEL[i]][j][Nr[conf] - 1] != oo)
                            DP[conf][i] = min(DP[conf][i],
                                              DP[Out(conf, i)][j] + Dist[CEL[i]][j][Nr[conf] - 1] * Nr[conf]);

    ll sol = oo;
    for(int i = 0; i < K; i++)
        sol = min(sol, DP[Confm - 1][i]);
    fout<<sol;
    return 0;
}