#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<string>

 #include<cstdlib>

 #include<ctime>

 #include<vector>

 #include<algorithm>

 #include<queue>

 using namespace std;

 #define LL long long

 const int maxn=;

 const int inf=;

 int d[maxn],vis[maxn],n,m,p,b[maxn];

 struct node{

     int y,next,v;

 }e[];

 int linkk[maxn],len=;

 void insert(int x,int y,int v){

     e[++len].y=y;

     e[len].next=linkk[x];

     linkk[x]=len;

     e[len].v=v;

 }

 typedef pair<int,int> pii;

 priority_queue<pii,vector<pii>,greater<pii> > q;

 int dij(int s){

     while(!q.empty())q.pop();

     q.push(make_pair(,s));

     memset(d,,sizeof(vis));d[s]=;

     memset(vis,,sizeof(vis));

     while(!q.empty()){

         int v=q.top().first;

         int x=q.top().second;

         q.pop();

         vis[x]=;

         for(int i=linkk[x];i;i=e[i].next){

             if(vis[e[i].y])continue;

             if(d[e[i].y]>v+e[i].v){

                 d[e[i].y]=v+e[i].v;

                 q.push(make_pair(d[e[i].y],e[i].y));

             }

         }

     }

     int ans=;

     for(int i=;i<=n;i++)ans+=d[b[i]];

     return ans;

 }

 void init(){

     scanf("%d%d%d",&n,&p,&m);//cow,muchang,daolu

     for(int i=;i<=n;i++)scanf("%d",&b[i]);

     int x,y,v;

     for(int i=;i<=m;i++){

         scanf("%d%d%d",&x,&y,&v);

         insert(x,y,v);insert(y,x,v);

     }

 }

 void work(){

     int minn=inf;

     for(int i=;i<=p;i++)minn=min(minn,dij(i));

     cout<<minn<<endl;

 }

 int main(){

     //freopen("1.in","r",stdin);

     //freopen("1.out","w",stdout);

     init();

     work();

 }