#include <bits/stdc++.h>

using pii = std::pair<int64_t, int>;

const int N = 5e2 + 10, M = 5e5 + 10;

inline int read() {
    int x = 0, f = 0;
    char ch = getchar();

    while (!isdigit(ch))
        f |= ch == '-', ch = getchar();

    while (isdigit(ch))
        x = x * 10 + ch - '0', ch = getchar();

    return f ? -x : x;
}

int a[N][N], b[N][N], id[N][N], Id[M];
int64_t dis[M], c[N][N], f[N][N];

int tot = 1, fir[M], nex[4 * M], got[4 * M], tak[4 * M];

inline void add(int u, int v, int w) {
    // printf("%d %d %d\n", u, v, w);
    nex[++tot] = fir[u], fir[u] = tot, got[tot] = v, tak[tot] = w;
    nex[++tot] = fir[v], fir[v] = tot, got[tot] = u, tak[tot] = w;
}

int main() {
    freopen("traffic.in", "r", stdin);
    freopen("traffic.out", "w", stdout);
    int n = read(), m = read(), q = read(), cnt = 0;

    for (int i = 1; i <= n - 1; ++i)
        for (int j = 1; j <= m; ++j)
            a[i][j] = read();

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m - 1; ++j)
            b[i][j] = read();

    for (int i = 0; i <= n; ++i)
        for (int j = 0; j <= m; ++j)
            id[i][j] = ++cnt;

    cnt = 0;

    for (int i = 1; i <= m; ++i)
        add(id[0][i], id[0][i - 1], 0), Id[++cnt] = id[0][i];

    for (int i = 1; i <= n; ++i)
        add(id[i][m], id[i - 1][m], 0), Id[++cnt] = id[i][m];

    for (int i = m; i >= 1; --i)
        add(id[n][i], id[n][i - 1], 0), Id[++cnt] = id[n][i - 1];

    for (int i = n; i >= 1; --i)
        add(id[i][0], id[i - 1][0], 0), Id[++cnt] = id[i - 1][0];

    for (int i = 1; i <= n - 1; ++i)
        for (int j = 1; j <= m; ++j)
            add(id[i][j], id[i][j - 1], a[i][j]);

    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= m - 1; ++j)
            add(id[i][j], id[i - 1][j], b[i][j]);

    for (int T = 1; T <= q; ++T) {
        int k = read(), s = 0;
        std::vector<std::pair<int, int>> vec, ran;

        for (int i = 1; i <= k; ++i) {
            int w = read(), x = read(), c = read();
            vec.emplace_back(x, c), s += c;
            tak[x << 1] = tak[x << 1 | 1] = w;
        }

        if (s == 0 || s == k) {
            puts("0");
            continue;
        }

        std::sort(vec.begin(), vec.end());

        for (int i = 1; i < vec.size(); ++i)
            if (vec[i].second != vec[i - 1].second)
                ran.emplace_back(vec[i - 1].first, vec[i].first);

        if (vec.back().second != vec.front().second)
            ran.emplace_back(vec.back().first, vec.front().first);

        memset(c, 0x3f, sizeof(c));

        for (int i = 0; i < ran.size(); i += 2) {
            int l = ran[i].first, r = ran[i].second;
            memset(dis, 0x3f, sizeof(dis));
            std::priority_queue<pii, std::vector<pii>, std::greater<pii>> que;

            for (int j = l; j < r; ++j)
                dis[Id[j]] = 0, que.emplace(0, Id[j]);

            while (!que.empty()) {
                int u = que.top().second;
                int64_t w = que.top().first;
                que.pop();

                if (dis[u] == w)
                    for (int i = fir[u]; i; i = nex[i])
                        if (dis[got[i]] > dis[u] + tak[i])
                            dis[got[i]] = dis[u] + tak[i], que.emplace(dis[got[i]], got[i]);
            }

            for (int j = 1; j < ran.size(); j += 2)
                c[j][i] = c[i][j] = dis[Id[ran[j].first]];
        }

        for (int i = 0; i < ran.size(); ++i)
            f[i][i + 1] = c[i][i + 1];

        for (int len = 4; len <= ran.size(); ++len)
            for (int i = 0, j = len - 1; j < ran.size(); ++i, ++j) {
                f[i][j] = c[i][j] + f[i + 1][j - 1];

                for (int t = i + 1; t <= j; t += 2)
                    f[i][j] = std::min(f[i][j], f[i][t] + f[t + 1][j]);
            }

        printf("%lld\n", f[0][ran.size() - 1]);

        for (int i = 0; i < vec.size(); ++i)
            tak[vec[i].first << 1] = tak[vec[i].first << 1 | 1] = 0;
    }

    return 0;
}