#include <cstdio>
#include <iostream>
#include <vector>
#include <cstring>
#include <queue>
using namespace std;
const int _maxn=100010;
struct e
{
	int to,dis;
};
struct e1
{
	int from,to,ans;
}query[_maxn],t1;
vector<e> v[_maxn];
vector<int> ques[_maxn];
queue<int> q;
int f[_maxn],n,dis[_maxn],ans1;
bool vis[_maxn];
bool cmp(e x,e y)
{
	return x.dis<y.dis;
}
void read()
{
	int m,x,y,z;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d%d",&x,&y,&z);
		v[x].push_back((e){y,z});
		v[y].push_back((e){x,z});
	}
	scanf("%d",&ans1);
	for(int i=1;i<=ans1;i++)
	{
		scanf("%d%d",&query[i].from,&query[i].to);
		query[i].ans=0;
		ques[query[i].from].push_back(i);
		ques[query[i].to].push_back(i);
	}
}
int find(int x){return f[x]==x?x:find(f[x]);}
void bfs()
{
	e t;
	q.push(1);
	dis[1]=0;
	vis[1]=true;
	while(!q.empty())
	{
		int u=q.front(),l=v[u].size();
		q.pop();
		for(int i=0;i<l;i++)
		{
			t=v[u][i];
			if(!vis[t.to])
			{
				dis[t.to]=dis[u]+t.dis;
				q.push(t.to);
				vis[t.to]=true;
			}
		}
	}
}
void lca(int x)
{
	e t;
	vis[x]=true;
	int l=v[x].size();
	for(int i=0;i<l;i++)
	{
		t=v[x][i];
		if(!vis[t.to])
		{
			lca(t.to);
			f[t.to]=x;
		}
	}
	l=ques[x].size();
	int u,uu;
	for(int i=0;i<l;i++)
	{
		u=ques[x][i];
		t1=query[u];
		if(t1.ans==0)
		{
			uu=((t1.from!=x)?t1.from:t1.to);
			if(vis[uu])
				query[u].ans=find(uu);
		}
	}
}
void solve()
{
	bfs();
	memset(vis,false,sizeof(vis));
	for(int i=1;i<=n;i++)
		f[i]=i;
	lca(1);
	for(int i=1;i<=ans1;i++)
		cout<<dis[query[i].from]+dis[query[i].to]-(dis[query[i].ans]<<1)<<endl;
}
int main()
{
	freopen("ThefallingofZLX.in","r",stdin);
	freopen("ThefallingofZLX.out","w",stdout);
	read();
	solve();
	return 0;
}