#include <cstdio>

#include <cassert>

#include <cstring>

#include <algorithm>

#include <cmath>

using namespace std;

const int MAX_X = , MAX_Y = , MAX_KEY = , MAX_S =  << , INF = 0x3f3f3f3f;

int Dist[MAX_X][MAX_Y][MAX_S];

int Key[MAX_X][MAX_Y];

int Gate[MAX_X][MAX_Y][MAX_X][MAX_Y];

int TotX, TotY;

const int xNext[] = { ,-,,, }, yNext[] = { , ,,-, };

struct Queue

{

    int xs[MAX_X*MAX_Y*MAX_S], ys[MAX_X*MAX_Y*MAX_S], ss[MAX_X*MAX_Y*MAX_S];

    int head, tail;

    Queue() { head = tail = ; }

    void push(int x, int y, int s) { xs[tail] = x; ys[tail] = y; ss[tail] = s; tail++; }

    void pop() { head++; }

    bool empty() { return head == tail; }

    int frontX() { return xs[head]; }

    int frontY() { return ys[head]; }

    int frontS() { return ss[head]; }

};

int Bfs()

{

    int ans = INF;

    static Queue q;

    Dist[][][Key[][]] = ;

    q.push(, , Key[][]);

    while (!q.empty())

    {

        int x = q.frontX(), y = q.frontY(), s = q.frontS();

        q.pop();

        Dist[x][y][s | Key[x][y]] = Dist[x][y][s];

        s |= Key[x][y];

        for (int p = ; p <= ; p++)

        {

            int x2 = x + xNext[p], y2 = y + yNext[p];

            if (x2 >=  && x2 <= TotX && y2 >=  && y2 <= TotY &&

                Dist[x2][y2][s]==INF &&

                (Gate[x][y][x2][y2] == - || s&( << Gate[x][y][x2][y2])))

            {

                Dist[x2][y2][s] = Dist[x][y][s] + ;

                q.push(x2, y2, s);

                if (x2 == TotX&&y2 == TotY)

                    ans = min(ans, Dist[x2][y2][s]);

            }

        }

    }

    return ans;

}

int main()

{

#ifdef _DEBUG

    freopen("c:\\noi\\source\\input.txt", "r", stdin);

#endif

    int totObs, totKeySort, x1, x2, y1, y2, gate, totKey, key;

    memset(Gate, -, sizeof(Gate));

    memset(Dist, INF, sizeof(Dist));

    scanf("%d%d%d%d", &TotX, &TotY, &totKeySort, &totObs);

    while (totObs--)

    {

        scanf("%d%d%d%d%d", &x1, &y1, &x2, &y2, &gate);

        Gate[x1][y1][x2][y2] = Gate[x2][y2][x1][y1] = gate;

    }

    scanf("%d", &totKey);

    while (totKey--)

    {

        scanf("%d%d%d", &x1, &y1, &key);

        if (key >= )

            printf("error\n");

        Key[x1][y1] |=  << key;

    }

    int ans = Bfs();

    if (ans == INF)

        printf("-1\n");

    else

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

    return ;

}