#include <stdio.h>

 #include <stdlib.h>

 #include <stdbool.h>

 #define maxn 1000

 /*

 1.

 1000*(1000*1000)*2000=2,0000,0000,0000

 订餐量*客户的数量*距离

 总数用__int64

 2.

 1000*(1000*1000)=10,0000,0000

 订餐量*客户的数量

 一个数总数用long

 */

 struct node

 {

     long x,y;

 };

 long dx[]={-,,,},dy[]={,-,,};

 long amount[maxn+][maxn+],dist[maxn+][maxn+];

 __int64 ans=;

 struct node que[maxn*maxn+];

 int main()

 {

     long head,tail,n,m,k,d,s,i,j,x,y,xx,yy;

     scanf("%ld%ld%ld%ld",&n,&m,&k,&d);

     head=;

     tail=;

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

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

             dist[i][j]=-;

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

     {

         scanf("%ld%ld",&x,&y);

         dist[x][y]=;

         tail++;

         que[tail].x=x;

         que[tail].y=y;

     }

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

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

             amount[i][j]=;

     for (i=;i<=k;i++)

     {

         scanf("%ld%ld%ld",&x,&y,&s);

         amount[x][y]+=s;

     }

     for (i=;i<=d;i++)

     {

         scanf("%ld%ld",&x,&y);

         dist[x][y]=-;

     }

     while (head<tail)

     {

         head++;

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

         {

             xx=que[head].x+dx[i];

             yy=que[head].y+dy[i];

             if (dist[xx][yy]==-)

             {

                 dist[xx][yy]=dist[que[head].x][que[head].y]+;

                 tail++;

                 que[tail].x=xx;

                 que[tail].y=yy;

             }

         }

     }

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

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

             ans+=amount[i][j]*dist[i][j];

     printf("%I64d\n",ans);

     return ;

 }