#include <bits/stdc++.h>
#define int long long
#define INF 1e18
using namespace std;

const int N = 1000000 + 5;
int n, m;
int k;
int vec[N];
int x[N], y[N];
int mp[N];
long long sum[N];
int vis[N], t[N];
int as[N], mn[N];
int fx[12] = {1, 0, -1, 0, 1, 1, -1, -1, -2, 0, 2, 0};
int fy[12] = {0, 1, 0, -1, 1, -1, 1, -1, 0, 2, 0, -2};

int id(int x, int y) {
    return x * m + y;
}

int fa[N], sz[N];
int find(int x) {
    return (x == fa[x] ? x : fa[x] = find(fa[x]));
}
void merge(int x, int y) {
    x = find(x), y = find(y);

    if (x == y) {
        return ;
    }

    fa[x] = y;
    sz[y] += sz[x];
}

signed main() {
#ifndef ONLINE_JUDGE
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif

    cin >> n >> m;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            // cout << id(i, j) << "\n";
            cin >> vec[id(i, j)];
        }
    }

    // cout << n << " "
    cin >> k;
    int ans = 0;

    for (int i = 1; i <= k; i++) {
        cin >> x[i] >> y[i];
        ans += vec[id(x[i], y[i])];
        mp[id(x[i], y[i])] = i;
        fa[i] = i;
        mn[i] = INF;
        sz[i] = 1;

        for (int j = 0; j < 4; j++) {
            int vx = x[i] + fx[j], vy = y[i] + fy[j];

            if (vx < 0 || vy < 0 || vx >= n || vy >= m) {
                continue;
            }

            sum[id(vx, vy)]++;
        }
    }

    for (int i = 1; i <= k; i++) {
        int ux = x[i], uy = y[i];

        for (int j = 0; j < 12; j++) {
            int vx = ux + fx[j], vy = uy + fy[j];

            if (vx < 0 || vy < 0 || vx >= n || vy >= m) {
                continue;
            }

            if (mp[id(vx, vy)]) {
                merge(i, mp[id(vx, vy)]);
            }
        }
    }

    for (int i = 1; i <= k; i++) {
        for (int j = 0; j < 4; j++) {
            int vx = x[i] + fx[j], vy = y[i] + fy[j];

            if (vx < 0 || vy < 0 || vx >= n || vy >= m) {
                continue;
            }

            if (!mp[id(vx, vy)] && !vis[id(vx, vy)]) {
                as[find(i)] += vec[id(vx, vy)];
                t[find(i)]++;
                vis[id(vx, vy)] = 1;

                if (sum[id(vx, vy)] >= 3) {
                    cout << "No\n";
                    return 0;
                }

                // if (sum[id(vx, vy)] == 1) {
                mn[find(i)] = min(mn[find(i)], vec[id(vx, vy)]);
                // }
            }
        }
    }

    for (int i = 1; i <= k; i++) {
        // cout << fa[i] << '\n';
        if (find(i) == i) {
            // cout << t[i] << " " << sz[i] << "\n";
            if (t[i] < 3 * sz[i]) {
                cout << "No\n";
                return 0;
            }

            if (t[i] > 3 * sz[i]) {
                ans += as[i] - mn[i];
            } else {
                ans += as[i];
            }
        }
    }

    cout << ans << "\n";

    return 0;
}