//minamoto

 #include<iostream>

 #include<cstdio>

 #include<queue>

 using namespace std;

 #define getc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)

 char buf[<<],*p1=buf,*p2=buf;

 inline int read(){

     #define num ch-'0'

     char ch;bool flag=;int res;

     while(!isdigit(ch=getc()))

     (ch=='-')&&(flag=true);

     for(res=num;isdigit(ch=getc());res=res*+num);

     (flag)&&(res=-res);

     #undef num

     return res;

 }

 const int N=;

 int vis[N][N][(<<N)],map[N][N][N][N],pas[N][N][N],num[N][N];

 struct node{

     int x,y,step,now;

     node(){}

     node(int x,int y,int step,int now):x(x),y(y),step(step),now(now){}

 };

 queue<node> q;

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

 int n,m,p,k;

 int bfs(){

     int now=;

     for(int i=;i<=num[][];++i)

     now|=(<<(pas[][][i]-));

     vis[][][now]=;

     q.push(node(,,,now));

     while(!q.empty()){

         node u=q.front();q.pop();

         if(u.x==n&&u.y==m) return u.step;

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

             int xx=u.x+dx[i],yy=u.y+dy[i],t;

             if(xx<||xx>n||yy<||yy>m) continue;

             if(map[u.x][u.y][xx][yy]==-) continue;

             if((t=map[u.x][u.y][xx][yy]))

             if(!(u.now&(<<(t-)))) continue;

             int nowx=u.now;

             for(int j=;j<=num[xx][yy];++j)

             nowx|=(<<(pas[xx][yy][j]-));

             if(vis[xx][yy][nowx]) continue;

             vis[xx][yy][nowx]=;

             q.push(node(xx,yy,u.step+,nowx));

         }

     }

     return -;

 }

 int main(){

     n=read(),m=read(),p=read(),k=read();

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

         int x1,x2,y1,y2,g;

         x1=read(),y1=read(),x2=read(),y2=read(),g=read();

         if(g==) map[x1][y1][x2][y2]=map[x2][y2][x1][y1]=-;

         else map[x1][y1][x2][y2]=map[x2][y2][x1][y1]=g;

     }

     int s=read();

     for(int i=;i<=s;++i){

         int x=read(),y=read(),p=read();

         pas[x][y][++num[x][y]]=p;

     }

     printf("%d\n",bfs());

     return ;

 }