#include<stdio.h>
#include<algorithm>
#include<vector>
#define pb push_back
#define mp make_pair
#define maxn 755
#define mask 1<<16
#define maxk 20
#define inf 0x3f3f3f3f
using namespace std;

struct edge{int node,cst,cap;};
int n,m,K,nh,sol,ok;
int h[maxn],pos[maxn],d[maxn],p[maxk];
int dist[maxk][maxk][maxk],s[mask][maxk];
vector<edge> l[maxn];

void read()
{
    int x,y,cost,capacity;
    scanf("%d%d%d",&K,&n,&m);

    for(int i=1;i<=K;i++)
        scanf("%d",&p[i]);

    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d%d",&x,&y,&cost,&capacity);
        l[x].pb({y,cost,capacity});
        l[y].pb({x,cost,capacity});
    }
}

void swap(int i,int j)
{
    int aux;
    aux=h[i]; h[i]=h[j]; h[j]=aux;
    pos[h[i]]=i; pos[h[j]]=j;
}

void heap_up(int k)
{
    if(k==1) return;
    int i=k/2;
    if(d[h[k]]<d[h[i]]) {swap(i,k); heap_up(i);}
}

void heap_dw(int k)
{
    int i=2*k;
    if(i<=nh)
    {
        if(i+1<=nh && d[h[i+1]]<d[h[i]]) i++;
        if(d[h[i]]<d[h[k]]) {swap(i,k); heap_dw(i);}
    }
}

int extract()
{
    swap(1,nh--);
    pos[h[nh+1]]=0;
    return h[nh+1];
}

void dijkstra(int S,int D)
{
    int k;
    for(int i=1;i<=n;i++) h[i]=i,pos[i]=i,d[i]=inf;
    d[S]=0; nh=n;

    while(nh)
    {
        k=extract();
        for(unsigned int i=0;i<l[k].size();i++)
         if(pos[l[k][i].node] && l[k][i].cap>=D && d[k]+l[k][i].cst<d[l[k][i].node] )
         {
             d[l[k][i].node]=d[k]+l[k][i].cst;
             heap_up(pos[l[k][i].node]);
         }
    }
}

void build_graph()
{
    for(int i=1;i<=K;i++)
     for(int j=1;j<=K;j++)
     {
         dijkstra(p[i],j);
         for(int k=1;k<=K;k++)
          dist[i][k][j]=d[p[k]];
     }

     dijkstra(1,0);
     for(int i=1;i<=K;i++)
      dist[0][i][0]=d[p[i]];
}

int number_of_b(int k)
{
    int nr=0;
    for(int i=0;(k>>i);i++)
      if( ((k>>i)&1) )  nr++;
    return nr;
}

void solve()
{
    int ms,b;
    for(int i=1;i<=K;i++) s[1<<(i-1)][i]=dist[0][i][0];
    for(int i=0;i<(1<<K);i++)
     for(int j=1;j<=K;j++)
     if( i!=(1<<(j-1)) && ((i>>(j-1))&1) )
     {
         s[i][j]=inf; b=number_of_b(i);
         for(int k=0;(i>>k);k++)
          if( ((i>>k)&1) && (k+1)!=j && dist[k+1][j][b-1]!=inf)
          {
              ms=i^(1<<(j-1));
              s[i][j]=min(s[i][j],s[ms][k+1]+(b-1)*dist[k+1][j][b-1]);
          }
     }
    sol=inf;
    for(int i=1;i<=K;i++) sol=min(sol,s[(1<<K)-1][i]);
}

int main()
{
    freopen("gather.in","r",stdin);
    freopen("gather.out","w",stdout);

    read();
    build_graph();
    solve();
    printf("%d",sol);


    fclose(stdin);
    fclose(stdout);
    return 0;
}