#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;

const int NMAX = 755, INF = 0x3f3f3f3f, CONFMAX = (1 << 16), KMAX = 16;

int N, M, K, A, B, C, D, Special[KMAX], Bit[CONFMAX], Cost[NMAX][NMAX], Det[NMAX][NMAX];
vector<int> G[NMAX];
bool InQueue[NMAX];
long long Dist[KMAX][NMAX][KMAX], Dp[CONFMAX][KMAX];

void GetMinDist(int Start, int MinD)
{
    for(int i = 1; i <= N; ++ i) Dist[Start][i][MinD] = INF;
    queue<int> Q;
    Dist[Start][Special[Start]][MinD] = 0;
    Q.push(Special[Start]);
    
    while(!Q.empty())
    {
        int Node = Q.front();
        Q.pop();
        InQueue[Node] = 0;
        
        for(vector<int> :: iterator it = G[Node].begin(); it != G[Node].end(); ++ it)
            if(Det[Node][*it] >= MinD && Dist[Start][*it][MinD] > Dist[Start][Node][MinD] + Cost[Node][*it])
            {
                Dist[Start][*it][MinD] = Dist[Start][Node][MinD] + Cost[Node][*it];
                if(!InQueue[*it])
                    InQueue[*it] = 1, Q.push(*it);
            }
    }
}

void Build_B()
{
    for(int i = 1; i < CONFMAX; ++ i)
        Bit[i] = Bit[i >> 1] + (i & 1);
}

long long GetAns()
{
    memset(Dp, INF, sizeof(Dp));
    Dp[1][0] = 0;
    for(int Conf = 1; Conf < (1 << (K + 1)); ++ Conf)
        for(int i = 0; i <= K; ++ i)
            if(Conf & (1 << i))
                for(int j = 0; j <= K; ++ j)
                    if(!(Conf & (1 << j)) && Dist[i][Special[j]][Bit[Conf] - 1] != INF)
                        if(Dp[Conf ^ (1 << j)][j] > Dp[Conf][i] + Bit[Conf] * Dist[i][Special[j]][Bit[Conf] - 1])
                            Dp[Conf ^ (1 << j)][j] = Dp[Conf][i] + Bit[Conf] * Dist[i][Special[j]][Bit[Conf] - 1];
    
    long long Ans = INF;
    for(int i = 1; i <= K; ++ i)
        Ans = min(Ans, Dp[(1 << (K + 1)) - 1][i]);
    return Ans;
}

int main()
{
    freopen("gather.in", "r", stdin);
    freopen("gather.out", "w", stdout);
    
    scanf("%i %i %i", &K, &N, &M);
    for(int i = 1; i <= K; ++ i)
        scanf("%i", &Special[i]);
    
    for(int i = 1; i <= M; ++ i)
    {
        scanf("%i %i %i %i", &A, &B, &C, &D);
        Cost[A][B] = Cost[B][A] = C;
        Det[A][B] = Det[B][A] = D;
        G[A].push_back(B);
        G[B].push_back(A);
    }
    Special[0] = 1;
    
    for(int i = 0; i <= K; ++ i)
        for(int j = 0; j <= K; ++ j)
            GetMinDist(i, j);
            
    Build_B();
    printf("%lld\n", GetAns());
    
    return 0;
}