#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned ll;
const int N=1e5+10;
int n,m,d,k,a[N];
tuple<int,int,int>e1[N],e2[N];
struct graph{
	int w,id;
}b[N];
int pos[N],val[N],fa[N];
int find(int x){
	return fa[x]==x?x:fa[x]=find(fa[x]);
}
ll suf[N];
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1,u,v,w;i<=m;i++){
		scanf("%d%d%d",&u,&v,&w);
		e1[i]={w,++u,++v};
	}
	scanf("%d",&d);
	for(int i=1;i<=d;i++){
		scanf("%d%d",&val[i],&b[i].w);
		b[i].id=i;
	}
	scanf("%d",&k);
	for(int x;k--;){
		scanf("%d",&x),a[++x]=1;
	}
	iota(fa,fa+1+n,0);
	sort(e1+1,e1+1+m);
	ll ans=k=0,sum=0;
	for(int i=1;i<=d;i++)sum+=b[i].w;
	for(int i=1;i<=m;i++){
		auto [w,u,v]=e1[i];
		int x=find(u),y=find(v);
		if(x==y)continue;
		if(a[x]>a[y])swap(x,y);
		if(a[x]&&a[y])e1[++k]={w,x,y};
		ans+=1ll*d*w+sum;
		fa[x]=y;
	}
	sort(b+1,b+1+d,[&](graph a,graph b){
		return a.w<b.w;
	});
	for(int i=1;i<=d;i++)pos[b[i].id]=i;
	for(int i=1;i<=d;i++){
		int u=pos[i],v=pos[i%d+1];
		e2[i]={val[i],u,v};
	}
	sort(e2+1,e2+1+d);
	for(int i=k;i>=1;i--){
		suf[i]=suf[i+1]+get<0>(e1[i]);
	}
	// debug(ans);
	// debug(ary(e1,1,k));
	iota(fa,fa+1+d,0);
	for(int i=1;i<d;i++){
		auto [w,x,y]=e2[i];
		if(b[find(x)].w>b[find(y)].w)swap(x,y);
		int l=0,r=k+1,mid;
		for(;l+1<r;){
			mid=(l+r)>>1;
			if(get<0>(e1[mid])+b[find(y)].w<w)l=mid;
			else r=mid;
		}
		ans+=1ll*(k-l+1)*w;
		ans-=suf[r];
		ans-=1ll*(k-l)*b[find(y)].w;
		// debug(w,x,y,b[find(x)].w,b[find(y)].w,i,ans);
		// debug("debug",l,k);
		fa[find(y)]=find(x);
	}
	cout<<ans<<endl;
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif