#include <bits/stdc++.h>
using namespace std;
ifstream f("gather.in");
ofstream g("gather.out");
int i,j,k,x,y,c,d,b,n,m,p,D[20];
long long sol=1LL<<50,a[1<<17][17],dp[17][17][755];
struct nod
{
    int x,y,z;
};
vector<nod> G[755];
priority_queue<pair<int,int> >Q;
void djk(int s,int L,long long v[])
{
    int x,d;
    for(int i=0;i<=n;++i) v[i]=sol;
    v[s]=0;
    Q.push(make_pair(0,s));
    while(!Q.empty())
    {
        d=-Q.top().first;
        x=Q.top().second;
        Q.pop();
        if(v[x]<d) continue;
        for(int i=0;i<G[x].size();++i)
        {
            if(G[x][i].z<L) continue;
            if(v[x]+G[x][i].y<v[G[x][i].x])
            {
                v[G[x][i].x]=v[x]+G[x][i].y;
                Q.push(make_pair(-v[G[x][i].x],G[x][i].x));
            }
        }
    }
    for(int i=1;i<=n;++i) if(v[i]<sol) v[i]*=(L+1);
}
int main()
{
    f>>k>>n>>m;
    for(i=1;i<=k;++i)
    {
        f>>D[i];
        --D[i];
    }
    for(i=1;i<=m;++i)
    {
        f>>x>>y>>c>>d;
        G[x-1].push_back({y-1,c,d});
        G[y-1].push_back({x-1,c,d});
    }
    for(i=0;i<=k+1;++i)
        for(j=0;j<=k+1;++j)
            djk(D[i],j,dp[i][j]);
    for(i=0;i<(1<<(k+1));++i)
        for(j=0;j<=k;++j) a[i][j]=sol;
    a[1][0]=0;
    for(i=2;i<(1<<(k+1));++i)
    {
        b=__builtin_popcount(i)-2;
        for(j=0;j<=k;++j)
            if(i&(1<<j))
                for(p=0;p<=k;++p) a[i][j]=min(a[i][j],a[i^(1<<j)][p]+dp[p][b][D[j]]);
    }
    for(i=0;i<=k;++i) sol=min(sol,a[(1<<(k+1))-1][i]);
    g<<sol;
    return 0;
}