#include<queue>
#include<vector>
#include<cstdio>
#include<cstring>
#include<utility>
#include<algorithm>
using namespace std;
const int M=21,N=102,INF=0x3f3f3f3f;
int n,m,k,e,d;
vector<pair<int,int>>ve[M];
bool can[M][N];
int dis[M];
bool vis[M],use[M];
void dijkstra(){
	fill(dis,dis+N,INF);
	fill(vis,vis+N,0);
	priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>q;
	dis[1]=0;
	q.push(make_pair(0,1));
	while(!q.empty()){
		int u=q.top().second;
		q.pop();
		if(vis[u]) continue;
		vis[u]=1;
		for(pair<int,int> e:ve[u]){
			int v=e.first;
			if(use[v]) continue;
			if(!vis[v]&&dis[v]>dis[u]+e.second){
				dis[v]=dis[u]+e.second;
				q.push(make_pair(dis[v],v));
			}
		}
	}
}
long long dp[N],rmb[N][N];
int main(){
	scanf("%d%d%d%d",&n,&m,&k,&e);
	for(int i=1;i<=e;++i){
		int u,v,value;
		scanf("%d%d%d",&u,&v,&value);
		ve[u].push_back(make_pair(v,value));
		ve[v].push_back(make_pair(u,value));
	}
	scanf("%d",&d);
	for(int i=1;i<=d;++i){
		int p,l,r;
		scanf("%d%d%d",&p,&l,&r);
		for(int j=l;j<=r;++j)
			can[p][j]=1;
	}
	for(int i=1;i<=n;++i)
		for(int j=i;j<=n;++j){
			fill(use,use+M,0);
			for(int k=1;k<=m;++k)
				for(int h=i;h<=j;++h)
					if(can[k][h]) use[k]=1;
			dijkstra();
			rmb[i][j]=dis[m];
		}
	for(int i=1;i<=n;++i){
		dp[i]=(long long)rmb[1][i]*i;
		for(int j=1;j<i;++j)
			dp[i]=min(dp[i],dp[j]+rmb[j+1][i]*(i-j)+k);
	}
	printf("%lld",dp[n]);
	return 0;
}