#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pr;
const ll inf=1e9;
struct E{
	int x,y,z;
}e[100005],reale[10005];
int n,m,fa[100005],a[100005],b[100005],L,R,is[100005],A,val[100005],cnt,pl[100005];
ll ans=0,sb=0,sv[100005];
int gf(int x){
	return x==fa[x]?x:fa[x]=gf(fa[x]);
}
int getcomp(int x){
	int pos=upper_bound(val+1,val+R,x)-val-1;
	return R-pos;
}
ll getse(int id,int x){
	int pos=upper_bound(val+1,val+R,x)-val-1;
	return sv[pos]+1ll*pos*b[id];
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1,x,y,z;i<=m;i++)scanf("%d%d%d",&x,&y,&z),e[i]={x+1,y+1,z};
	sort(e+1,e+m+1,[](E x,E y){return x.z<y.z;});
	scanf("%d",&L);
	for(int i=1;i<=L;i++)scanf("%d%d",&a[i],&b[i]),sb+=b[i];
	scanf("%d",&R);
	for(int i=1,x;i<=R;i++)scanf("%d",&x),is[x+1]=1,A=x+1;
	for(int i=1;i<=n;i++)fa[i]=(is[i]?A:i);
	for(int i=1;i<=m;i++){
		int x=gf(e[i].x),y=gf(e[i].y);
		if(x==y)continue;
		fa[x]=y,reale[++cnt]=e[i],ans+=1ll*L*e[i].z+sb;
	}
	for(int i=1;i<=n;i++)fa[i]=i;
	for(int i=1;i<=cnt;i++)fa[gf(reale[i].x)]=gf(reale[i].y);
	int ts=0;
	for(int i=1;i<=m;i++){
		int x=gf(e[i].x),y=gf(e[i].y);
		if(x==y)continue;
		fa[x]=y,val[++ts]=e[i].z,sv[ts]=sv[ts-1]+e[i].z;
	}
	assert(ts==R-1);
	for(int i=1;i<=L;i++)fa[i]=i,pl[i]=i;
	sort(pl+1,pl+L+1,[](int x,int y){return a[x]<a[y];});
	for(int i=1;i<L;i++){
		int x=gf(pl[i]),y=gf(x%L+1);
		if(b[x]<b[y]){
			ans+=1ll*a[x]*getcomp(a[x]-b[y])+getse(y,a[x]-b[y]);
			fa[x]=y,b[y]=b[x];
		}
		else {
			ans+=1ll*a[x]*getcomp(a[x]-b[x])+getse(x,a[x]-b[x]);
			fa[x]=y;
		}
	}
	//cout<<a[gf(1)]-b[gf(1)]<<'\n';
	cout<<ans+getse(gf(1),inf);
}