//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int B=1000;
int n,m,q;
int u[1001000],v[1001000],w[1001000];
vector<pii> G[1001000];
int deg[1001000];
int a[1001000],b[1001000];
int ans[1001000];
bitset<1024> bs[1000001];
map<pii,int> Mp;
vector<int> large;
vector<pii> vq[1001000];
int dist[1001000],dist2[1001000];
int memo[1001000];
map<pii,int> Mem;
int calc(int x,int y)
{
	int ans=inf;
	for(auto pr:G[y])
	{
		int p=lb(G[x],mp(pr.first,0));
		if(p<sz(G[x])&&G[x][p].first==pr.first)
			ans=min(ans,G[x][p].second+pr.second);
	}
	return ans;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	B=2*sqrt(n);
	for(int i=1;i<=m;i++)
	{
		cin>>u[i]>>v[i]>>w[i];
		G[u[i]].pb(v[i],w[i]);
		G[v[i]].pb(u[i],w[i]);
		deg[u[i]]++;
		deg[v[i]]++;
		Mp[mp(u[i],v[i])]=w[i];
		Mp[mp(v[i],u[i])]=w[i];
	}
	for(int i=1;i<=n;i++)
		srt(G[i]);
	cin>>q;
	for(int i=1;i<=q;i++)
	{
		cin>>a[i]>>b[i];
		if(Mem.count(mp(a[i],b[i])))
		{
			memo[i]=Mem[mp(a[i],b[i])];
			continue;
		}
		Mem[mp(a[i],b[i])]=Mem[mp(b[i],a[i])]=i;
	}
	memset(ans,0x3f,sizeof(ans));
	for(int i=1;i<=q;i++)
		if(Mp.count(mp(a[i],b[i])))
			ans[i]=Mp[mp(a[i],b[i])];
	for(int i=1;i<=n;i++)
		if(deg[i]>B)
			large.pb(i);
	srt(large);
	assert(sz(large)<=1024);
	for(int i=1;i<=m;i++)
	{
		if(deg[u[i]]>B)
			bs[v[i]][lb(large,u[i])]=1;
		if(deg[v[i]]>B)
			bs[u[i]][lb(large,v[i])]=1;
	}
	for(int i=1;i<=q;i++) if(!memo[i])
	{
		if(deg[a[i]]>B)
			vq[a[i]].pb(b[i],i);
		else if(deg[b[i]]>B)
			vq[b[i]].pb(a[i],i);
		else
		{
			ans[i]=min(ans[i],calc(a[i],b[i]));	
			for(auto pr:G[a[i]])
				ans[i]=min(ans[i],calc(pr.first,b[i])+pr.second);
		}
	}
	for(int i=1;i<=n;i++)
		if(deg[i]>B)
		{
			memset(dist,0x3f,sizeof(dist));
			memset(dist2,0x3f,sizeof(dist2));
			dist[i]=0;
			for(int j=0;j<3;j++)
			{
				for(int k=1;k<=m;k++)
				{
					dist2[v[k]]=min(dist2[v[k]],dist[u[k]]+w[k]);
					dist2[u[k]]=min(dist2[u[k]],dist[v[k]]+w[k]);
				}
				for(int k=1;k<=n;k++)
					dist[k]=min(dist[k],dist2[k]);
			}
			for(auto pr:vq[i])
				ans[pr.second]=min(ans[pr.second],dist[pr.first]);
		}
	for(int i=1;i<=q;i++)
	{
		if(memo[i])
			ans[i]=ans[memo[i]];
		if(ans[i]<inf)
			cout<<ans[i]<<'\n';
		else
			cout<<"-1\n";
	}
	return 0;
}