#include <stdio.h>
#include <string.h>
#define NM 1000000
#define INF 0x3f3f3f3f
int min(int a, int b) { return a < b ? a : b; }
int di[] = { -1, 1, 0, 0 };
int dj[] = { 0, 0, -1, 1 };
int ds[NM], vv[NM], ee[NM], ww[NM];
int find(int i) {
return ds[i] < 0 ? i : (ds[i] = find(ds[i]));
}
void join(int i, int j) {
i = find(i);
j = find(j);
if (i == j) {
ee[i]++;
return;
}
if (ds[i] > ds[j])
ds[i] = j, vv[j] += vv[i], ee[j] += ee[i] + 1, ww[j] = min(ww[j], ww[i]);
else {
if (ds[i] == ds[j])
ds[i]--;
ds[j] = i, vv[i] += vv[j], ee[i] += ee[j] + 1, ww[i] = min(ww[i], ww[j]);
}
}
int main() {
static int aa[NM], ej[NM][2], eo[NM];
int n, m, nm, k, h, i, j, ij;
long long ans;
scanf("%d%d", &n, &m), nm = n * m;
for (i = 0; i < nm; i++)
scanf("%d", &aa[i]);
scanf("%d", &k);
memset(ww, 0x3f, nm * sizeof *ww);
ans = 0;
while (k--) {
scanf("%d%d", &i, &j), ij = i * m + j;
ans += aa[ij];
for (h = 0; h < 4; h++) {
int i_ = i + di[h], j_ = j + dj[h], ij_ = i_ * m + j_;
if (i_ >= 0 && i_ < n && j_ >= 0 && j_ < m) {
if (eo[ij_] == 2) {
printf("No\n");
return 0;
}
ej[ij_][eo[ij_]++] = ij;
ans += aa[ij_];
ww[ij] = min(ww[ij], aa[ij_]);
} else {
ans += -INF;
ww[ij] = -INF;
}
}
}
memset(ds, -1, nm * sizeof *ds);
for (i = 0; i < nm; i++)
vv[i] = 1;
for (i = 0; i < nm; i++)
if (eo[i] == 2)
join(ej[i][0], ej[i][1]), ans -= aa[i];
for (i = 0; i < nm; i++)
if (ds[i] < 0) {
if (vv[i] < ee[i]) {
printf("No\n");
return 0;
}
if (vv[i] > ee[i] && ww[i] != INF)
ans -= ww[i];
}
if (ans < 0) {
printf("No\n");
return 0;
}
printf("%lld\n", ans);
return 0;
}
