#include<algorithm>

 #include<iostream>

 #include<cstdlib>

 #include<cstring>

 #include<cstdio>

 #include<string>

 #include<cmath>

 #include<ctime>

 #include<queue>

 #include<stack>

 #include<map>

 #include<set>

 #define rre(i,r,l) for(int i=(r);i>=(l);i--)

 #define re(i,l,r) for(int i=(l);i<=(r);i++)

 #define Clear(a,b) memset(a,b,sizeof(a))

 #define inout(x) printf("%d",(x))

 #define douin(x) scanf("%lf",&x)

 #define strin(x) scanf("%s",(x))

 #define LLin(x) scanf("%lld",&x)

 #define op operator

 #define CSC main

 typedef unsigned long long ULL;

 typedef const int cint;

 typedef long long LL;

 using namespace std;

 cint inf=;

 void inin(int &ret)

 {

     ret=;int f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=;ch=getchar();}

     while(ch>=''&&ch<='')ret*=,ret+=ch-'',ch=getchar();

     ret=f?-ret:ret;

 }

 int head[],next[],zhi[],w[],si[],v[],ed;

 int shu[],dis[],col[],bo[];

 int cc[],t[];

 int n,m,k,sum,ans,root,T;

 void add(int a,int b,int c)

 {

     next[++ed]=head[a],head[a]=ed,zhi[ed]=b,v[ed]=c;

     next[++ed]=head[b],head[b]=ed,zhi[ed]=a,v[ed]=c;

 }

 void getroot(int x,int fa)

 {

     w[x]=,si[x]=;

     for(int i=head[x];i;i=next[i])if(!bo[zhi[i]]&&zhi[i]!=fa)

     {

         getroot(zhi[i],x);

         si[x]+=si[zhi[i]];

         w[x]=max(w[x],si[zhi[i]]);

     }

     w[x]=max(w[x],sum-si[x]);

     if(w[x]<w[root])root=x;

 }

 int lowbit(int x){return x&-x;}

 int query(int r)

 {

     int ret=-inf;r++;

     while(r)

     {

         if(t[r]==T)ret=max(ret,cc[r]);

         r-=lowbit(r);

     }

     return ret;

 }

 void add_(int c,int x)

 {

     c++;

     while(c<=k+)

     {

         if(t[c]==T)cc[c]=max(cc[c],x);

         else t[c]=T,cc[c]=x;

         c+=lowbit(c);

     }

 }

 void getans(int x,int fa)

 {

     if(shu[x]-col[root]>k)return ;

     int hh=query(k-shu[x]+col[root]);

     if(hh!=-inf)ans=max(ans,hh+dis[x]);

     for(int i=head[x];i;i=next[i])if(!bo[zhi[i]]&&zhi[i]!=fa)

         dis[zhi[i]]=dis[x]+v[i],shu[zhi[i]]=col[zhi[i]]+shu[x],getans(zhi[i],x);

 }

 void add(int x,int fa)

 {

     if(shu[x]-col[root]>k)return ;

     add_(shu[x],dis[x]);

     for(int i=head[x];i;i=next[i])if(!bo[zhi[i]]&&zhi[i]!=fa)

         add(zhi[i],x);

 }

 void solve(int x)

 {

     T++;

     bo[x]=;add_(col[x],);

     for(int i=head[x];i;i=next[i])if(!bo[zhi[i]])

     {

         shu[zhi[i]]=col[x]+col[zhi[i]],dis[zhi[i]]=v[i];

         getans(zhi[i],x);

         add(zhi[i],x);

     }

     for(int i=head[x];i;i=next[i])if(!bo[zhi[i]])

         root=,sum=si[zhi[i]],getroot(zhi[i],),solve(root);

 }

 int CSC()

 {

     inin(n),inin(k),inin(m);

     re(i,,m)

     {

         int x;inin(x);

         col[x]=;

     }

     re(i,,n)

     {

         int q,w,e;

         inin(q),inin(w),inin(e);

         add(q,w,e);

     }

     w[]=sum=n;

     getroot(,);

     re(i,,k+)cc[i]=-inf;

     ans=-inf;

     solve(root);

     printf("%d",max(ans,));

     return ;

 }