#include<bits/stdc++.h>
using namespace std;
//f[i]=min(f[i],f[j]+(l-j)*val+k)//1<=j<=i
int n,n1,k,m,p;
bool dead[25][105],broken[25],vis[25];
int dis[105],f[105];
int cnt,head[105];
struct edge{
    int x,y,val,next;
}e[10005];

void add(int x,int y,int val){
    e[++cnt]=(edge){x,y,val,head[x]};
    head[x]=cnt;
}

int spfa(){
    memset(vis,false,sizeof(vis));
    memset(dis,0x3f,sizeof(dis));
    queue<int> q;
    dis[1]=0;
    vis[1]=true;
    q.push(1);
    while(!q.empty()){
        int x=q.front();
        q.pop();
        vis[x]=false;
        for(int i=head[x];i;i=e[i].next){
            int y=e[i].y;
            if(!broken[y]&&dis[y]>dis[x]+e[i].val){
                dis[y]=dis[x]+e[i].val;
                if(!vis[y]){
                    q.push(y);
                    vis[y]=true;
                }
            }
        }
    }
    return dis[n1];
}

int main(){
    scanf("%d%d%d%d",&n,&n1,&k,&m);
    for(int i=1;i<=m;i++){
        int x,y,val;
        scanf("%d%d%d",&x,&y,&val);
        add(x,y,val);
        add(y,x,val);
    }
    int d;
    scanf("%d",&d);
    for(int i=1;i<=d;i++){
        int id,x,y;
        scanf("%d%d%d",&id,&x,&y);
        for(int j=x;j<=y;j++)
         dead[id][j]=true;
    }
    memset(f,0x3f,sizeof(f));
    f[0]=-k;
    for(int i=1;i<=n;i++){
        memset(broken,false,sizeof(broken));
        for(int j=i;j;j--){//在第j天改线路 
            for(int l=1;l<=m;l++)
             broken[l]|=dead[l][j];
            int ret=spfa();
            if(ret==dis[0]) break;
            f[i]=min(f[i],f[j-1]+(i-j+1)*ret+k);
        }
    }
    printf("%d",f[n]);
}