#include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<cmath>

 #include<algorithm>

 #define qread(x) x=read()

 using namespace std;

 inline int read()

 {

     int f=,x=;char ch;

     while(ch<'' || ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>='' && ch<=''){x=x*+ch-'';ch=getchar();}

     return f*x;

 }

 int n,m,k,e,D;

 struct edge

 {

     int x,y,d,next;

 }a[];int len,last[];

 void ins(int x,int y,int d)

 {

     len++;a[len].x=x;a[len].y=y;a[len].d=d;

     a[len].next=last[x];last[x]=len;

 }

 int flag[][],f[],d[],list[];

 int spfa(int st,int ed)

 {

     for(int i=;i<=m;i++)d[i]=;

     int head=,tail=;list[]=;d[]=;

     while(head!=tail)

     {

         int x=list[head];

         for(int k=last[x];k;k=a[k].next)

         {

             int y=a[k].y;

             if((flag[y][ed]-flag[y][st-]==) && (d[y]>d[x]+a[k].d))

             {

                 d[y]=d[x]+a[k].d;

                 list[tail++]=y;

                 if(tail==m+)tail=;

             }

         }

         head++;if(head==m+)head=;

     }

     return d[m];

 }

 int main()

 {

     qread(n);qread(m);qread(k);qread(e);

     len=;memset(last,,sizeof(last));

     for(int i=;i<=e;i++)

     {

         int x,y,d;

         qread(x);qread(y);qread(d);

         ins(x,y,d);ins(y,x,d);

     }

     scanf("%d",&D);

     memset(flag,,sizeof(flag));

     for(int i=;i<=D;i++)

     {

         int p,x,y;

         qread(p);qread(x);qread(y);

         for(int j=x;j<=y;j++)flag[p][j]=;

     }

     for(int i=;i<=m;i++)

         for(int j=;j<=n;j++)

             flag[i][j]+=flag[i][j-];

     f[]=;

     for(int i=;i<=n;i++)

     {

         f[i]=;

         for(int j=;j<=i;j++)

         {

             int cost=spfa(j,i);

             f[i]=min(f[i],f[j-]+cost*(i-j+)+k);

         }

     }

     printf("%d\n",f[n]-k);

     return ;

 }