#include <iostream>
#include <cstring>
#define int long long

using namespace std;

const int N = 510, M = 6010;
const int INF = 0x3f3f3f3f3f3f3f3f;

int n, m, S, T;
int h[N], e[M], ne[M], f[M], idx;
int d[N], q[N], cur[N];
int ver[N], ans[N][N], t1[N], t2[N];

inline void add(int a, int b, int c)
{
    e[idx] = b, f[idx] = c, ne[idx] = h[a], h[a] = idx ++ ;
    e[idx] = a, f[idx] = 0, ne[idx] = h[b], h[b] = idx ++ ;
}

bool bfs()
{
    memset(d, -1, sizeof d);
    int hh = 0, tt = 0;
    q[0] = S, d[S] = 0, cur[S] = h[S];

    while (hh <= tt)
    {
        int t = q[hh ++ ];
        for (int i = h[t]; ~i; i = ne[i])
        {
            int j = e[i];
            if (d[j] == -1 && f[i])
            {
                d[j] = d[t] + 1;
                cur[j] = h[j];
                if (j == T) return true;
                q[ ++ tt] = j;
            }
        }
    }
    return false;
}

int find(int u, int lim)
{
    if (u == T) return lim;
    int flow = 0;
    for (int i = cur[u]; ~i && flow < lim; cur[u] = i, i = ne[i])
    {
        int j = e[i];
        if (d[j] == d[u] + 1 && f[i])
        {
            int t = find(j, min(f[i], lim - flow));
            if (!t) d[j] = -1;
            f[i] -= t, f[i ^ 1] += t, flow += t;
        }
    }
    return flow;
}

int dinic()
{
    for (int i = 0; i < idx; i += 2)
        f[i] += f[i ^ 1], f[i ^ 1] = 0;
    int r = 0, flow = 0;
    while (bfs()) while ((flow = find(S, INF))) r += flow;
    return r;
}

void solve(int l, int r)
{
    if (l == r) return;
    S = ver[l], T = ver[l + 1];
    int res = dinic(), s = ver[l], t = ver[l + 1];
    ans[S][T] = ans[T][S] = res;
    
    int cnt1 = 0, cnt2 = 0;
    for (int i = l; i <= r; i ++ )
        if (d[ver[i]]) t1[ ++ cnt1] = ver[i];
        else t2[ ++ cnt2] = ver[i];

    for (int i = 1; i <= cnt1; i ++ ) ver[l + i - 1] = t1[i];
    for (int i = 1; i <= cnt2; i ++ ) ver[cnt1 + l + i - 1] = t2[i];

    solve(l, l + cnt1 - 1);
    solve(l + cnt1, r);

    for (int i = 1; i <= cnt1; i ++ )
        for (int j = 1; j <= cnt2; j ++ )
        {
            int a = ver[l + i - 1], b = ver[l + j + cnt1 - 1];
            ans[a][b] = ans[b][a] = min(min(ans[a][s], ans[s][t]), ans[t][b]);
        }
}

signed main()
{
    int a, b, c;
    memset(h, -1, sizeof h);
    memset(ans, 0x3f, sizeof ans);

    scanf("%lld%lld", &n, &m);
    while (m -- )
    {
        scanf("%lld%lld%lld", &a, &b, &c);
        add(a, b, c), add(b, a, c);
    }

    for (int i = 0; i <= n; i ++ ) ver[i] = i;
    solve(0, n);

    scanf("%lld", &m);
    while (m -- )
    {
        scanf("%lld%lld", &a, &b);
        printf("%lld\n", ans[a][b]);
    }

    return 0;
}