import sys

input = sys.stdin.readline

N,M = map(int,input().split())
edge = [tuple(map(int,input().split())) for i in range(M)]

assert 2<=N<=100
assert 1<=M<=N*(N-1)//2

assert len(edge)==M
check = set([])
for u,v,c in edge:
    assert 1<=u<=N and 1<=v<=N
    assert u!=v
    assert 1<=c<=10**9
    assert (u,v) not in check
    check.add((u,v))

cost = [[10**18 for j in range(N)] for i in range(N)]
for i in range(N):
    cost[i][i] = 0
for u,v,c in edge:
    cost[u-1][v-1] = 1

for k in range(N):
    for i in range(N):
        for j in range(N):
            if cost[i][j] > cost[i][k] + cost[k][j]:
                cost[i][j] = cost[i][k] + cost[k][j]

edge.sort(key=lambda x:x[2])
ans = [[-1 for j in range(N)] for i in range(N)]
S = set([])

for u,v,c in edge:
    for i in range(N):
        for j in range(N):
            if abs(cost[i][u-1])!=10**18 and abs(cost[v-1][j])!=10**18 and cost[i][j] > cost[i][u-1] + cost[v-1][j] - 1:
                cost[i][j] = cost[i][u-1] + cost[v-1][j] - 1
                if cost[i][j] <=0 and ans[i][j]==-1:
                    ans[i][j] = c


    for k in range(N):
        if cost[k][k] < 0 and k not in S:
            S.add(k)
            for i in range(N):
                for j in range(N):
                    if cost[i][k]!=10**18 and cost[k][j]!=10**18:
                        cost[i][j] = -10**18
                        if ans[i][j]==-1:
                            ans[i][j] = c

Q = int(input())
assert 1<=Q<=N*(N-1)
res = [-1 for i in range(Q)]
for i in range(Q):
    s,t = map(int,input().split())
    assert 1<=s<=N and 1<=t<=N
    assert s!=t
    res[i] = ans[s-1][t-1]

print(*res,sep="\n")