#include <bits/stdc++.h>
 
using std::max;
 
const int N=15,Inf=1e9+10;
 
int n,m,map[N][N],f[N][1<<N],M[N][1<<N],sum[1<<N];
 
void Init() {
	scanf("%d%d",&n,&m);
	int a,b,c;
	for (int i=1;i<=m;++i) {
		scanf("%d%d%d",&a,&b,&c);
		a--; b--; 
		map[a][b]=map[b][a]=c;
	}
}
 
int summ;
bool vis[N];
void Dfs(int x,int s) {
	if (vis[x]) return ;
	vis[x]=1;
	for (int i=0;i<n;++i) if ((1<<i)&s && map[x][i]) {
		summ+=map[x][i];
		Dfs(i,s);
	}
}
 
void Solve() {
	int Max=1<<n;
	for (int s=0;s<Max;++s) {
		summ=0;
		for (int i=0;i<n;++i) vis[i]=0;
		for (int i=0;i<n;++i) if ((1<<i)&s) Dfs(i,s);
		sum[s]=summ>>1;
	}
	
	summ=0;
	for (int i=0;i<n;++i)
		for (int j=i;j<n;++j) summ+=map[i][j];
	for (int i=0;i<n;++i)
		for (int s=0;s<Max;++s) f[i][s]=-Inf,M[i][s]=-Inf;
	M[0][1]=0;
	for (int s=0;s<Max;++s) if (s&1) {
		f[0][s]=sum[s];
		for (int t=0;t<n;++t) 
			if (map[t][0]) M[t][s]=max(M[t][s],f[0][s]+map[t][0]);
	}
	for (int s=0;s<Max;++s) {
		for (int i=0;i<n;++i) if ((1<<i)&s) {
			for (int p=s;p;p=(p-1)&s) if (!((1<<i)&p)) {
				f[i][s]=max(f[i][s],M[i][p]+sum[s^p]);
			}
			for (int t=0;t<n;++t) if (map[t][i]) M[t][s]=max(M[t][s],f[i][s]+map[t][i]);
		}
	}
	
	printf("%d\n",summ-f[n-1][Max-1]);
}
 
int main() {
	Init();
	Solve();
	return 0;
}
#include <queue>
#include <cstring>
#include <iostream>
using namespace std;

int rcount[2001][2001], d[2001][2001], u[2001][2001], r[2001][2001], l[2001][2001];

int main() {
    int n, m, q; cin >> n >> m >> q;
    string s[n];
    for (int i = 0; i < n; i++) cin >> s[i];
    for (int x = 1; x <= n; x++)
        for (int y = 1; y <= m; y++) {
            if (s[x-1][y-1] != '1') continue;
            rcount[x][y] = 1;
            queue<pair<int, int> > q;
            q.push({x, y});
            while (!q.empty()) {
                int i = q.front().first, j = q.front().second;
                q.pop();
                s[i-1][j-1] = '2';
                const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
                for (int k = 0; k < 4; k++) {
                    int i1 = i + dx[k], j1 = j + dy[k];
                    if (0 < i1 && 0 < j1 && i1 <= n && j1 <= m && s[i1-1][j1-1] == '1') {
                        q.push({i1, j1});
                        if (i1 < i) u[i1][j] = 1;
                        else if (i1 > i) d[i1][j] = 1;
                        else if (j1 < j) l[i][j1] = 1;
                        else /* j1 > j */ r[i][j1] = 1;
                    }
                }
            }
        }
    for (int x = 1; x <= n; x++)
        for (int y = 1; y <= m; y++) {
            rcount[x][y] += rcount[x-1][y] + rcount[x][y-1] - rcount[x-1][y-1];
            d[x][y] += d[x][y-1];
            u[x][y] += u[x][y-1];
            r[x][y] += r[x-1][y];
            l[x][y] += l[x-1][y];
        }

    while (q--) {
        int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
        int ans = rcount[x2][y2] - rcount[x1-1][y2] - rcount[x2][y1-1] + rcount[x1-1][y1-1];
        ans += r[x2][y1] - r[x1-1][y1];
        ans += l[x2][y2] - l[x1-1][y2];
        ans += d[x1][y2] - d[x1][y1-1];
        ans += u[x2][y2] - u[x2][y1-1];
        cout << ans << endl;
    }
}
