#include<stdio.h>
#include<vector>
#include<set>
using namespace std;

#define minim(a,b) (a<b ? a : b)
#define pb push_back
#define NMAX 805
#define INF 1000000000000000LL
#define ll long long

ll n,m,k,cell[105];
ll dist[NMAX],viz[NMAX];
ll d[18][18][NMAX];
ll sol,bst[35006][17];
ll nrbit[35006];
vector<ll> v[NMAX],cost[NMAX],perm[NMAX];

class cmp
{
public:
    bool operator()(const int& a,const int& b)
    {return dist[a]<dist[b];}
};

multiset<int,cmp> myset;

void dijkstra(int ind,int nrd)
{
    int i,j,p,lim,start=cell[ind];
    
    myset.clear();
    for(i=1;i<=n;i++)
        dist[i]=INF;
    dist[start]=0;        
    for(i=1;i<=n;i++)
        myset.insert(i);

    viz[start]=0;
    for(i=1;i<=n;i++)
    {
        if(myset.size()==0)
            break;
        p=*myset.begin();
        myset.erase(myset.begin());
        if(viz[p])
            continue;
        lim=v[p].size();
        for(j=0;j<lim;j++)
            if(perm[p][j]>=nrd
            && dist[v[p][j]]>dist[p]+cost[p][j])
            {
                myset.erase(v[p][j]);
                dist[v[p][j]]=dist[p]+cost[p][j];
                myset.insert(v[p][j]);
            }
    }
    if(ind)
        viz[start]=1;
    for(i=1;i<=n;i++)
        if(dist[i]!=INF)
            d[ind][nrd][i]=dist[i]*(nrd+1);
        else
            d[ind][nrd][i]=dist[i];
}

int main ()
{
    ll i,j,t;
    ll a,b,c,d2,cf;
    
    freopen("gather.in","r",stdin);
    freopen("gather.out","w",stdout);
    scanf("%lld%lld%lld",&k,&n,&m);
    for(i=1;i<=k;i++)
    {
        scanf("%lld",&cell[i]);
        viz[cell[i]]=1;
    }
    for(i=1;i<=m;i++)
    {
        scanf("%lld%lld%lld%lld",&a,&b,&c,&d2);
        v[a].pb(b);
        cost[a].pb(c);
        perm[a].pb(d2);
        
        v[b].pb(a);
        cost[b].pb(c);
        perm[b].pb(d2);
    }
    cell[0]=1;
    dijkstra(0,0);
    for(i=1;i<=k;i++)
        for(j=1;j<k;j++)
            dijkstra(i,j);

    for(i=1;i<(1<<k);i++)
        for(j=1;j<=k;j++)
            bst[i][j]=INF;
            
    for(i=1;i<=k;i++)
        bst[1<<(i-1)][i]=d[0][0][cell[i]];
        
    for(i=1;i<(1<<k);i++)
    {
        nrbit[i]=nrbit[i/2]+(i&1);
        for(j=1;j<=k;j++)
            if(i&(1<<(j-1)))
            {
                if(bst[i][j]==INF)
                    continue;
                for(t=1;t<=k;t++)
                    if(!(i&(1<<(t-1))))
                    {
                        cf=i+(1<<(t-1));
                        bst[cf][t]=minim(bst[cf][t],
                            bst[i][j]+d[j][nrbit[i]][cell[t]]);
                    }
            }
    }
    sol=INF;
    for(i=1;i<=k;i++)
        sol=minim(sol,bst[(1<<k)-1][i]);
    printf("%lld\n",sol);
    return 0;
}