#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<algorithm>
#include<queue>using namespace std;typedef long long ll;const int inf = 0x3f3f3f3f;
const int maxn = 100+10;int head[maxn],cnt;
struct Edge{int to,val,next;
}edge[maxn<<4];
ll tim[maxn][maxn],f[maxn][maxn];
bool flag[maxn][maxn],block[maxn],vis[maxn];
int dis[maxn];
int n,m,k;void add(int u,int v,int w){edge[cnt].to=v;edge[cnt].val=w;edge[cnt].next=head[u];head[u]=cnt++;
}
int spfa(int s,int e){memset(block,false,sizeof(block));memset(vis,false,sizeof(vis));memset(dis,inf,sizeof(dis));queue<int>q;q.push(1);vis[1]=true;dis[1]=0;for(int i=s;i<=e;i++){for(int j=1;j<=m;j++){if(flag[i][j]){block[j]=true;}}}while(!q.empty()){int u=q.front();q.pop();for(int i=head[u];i!=-1;i=edge[i].next){int v=edge[i].to;int w=edge[i].val;if(!block[v]&&dis[v]>dis[u]+w){dis[v]=dis[u]+w;if(!vis[v]){vis[v]=true;q.push(v);}}}vis[u]=false;}return dis[m];
}
void dp(){for(int l=1;l<=n;l++){for(int s=1;s<=n;s++){int e=s+l-1;if(e>n) continue;f[s][e]=(ll)tim[s][e]*(e-s+1);for(int z=s;z<e;z++){f[s][e]=min(f[s][e],f[s][z]+k+f[z+1][e]);}}}
}
int main(){memset(head,-1,sizeof(head));cnt=0;int p;scanf("%d%d%d%d",&n,&m,&k,&p);for(int i=1;i<=p;i++){int u,v,w;scanf("%d%d%d",&u,&v,&w);add(u,v,w);add(v,u,w);}int q;scanf("%d",&q);for(int i=1;i<=q;i++){int id,u,v;scanf("%d%d%d",&id,&u,&v);for(int j=u;j<=v;j++){flag[j][id]=true;}}for(int i=1;i<=n;i++){for(int j=i;j<=n;j++){tim[i][j]=spfa(i,j);}}dp();cout<<f[1][n]<<endl;return 0;
}