#include<bits/stdc++.h>
using namespace std;
//#define int long long 

inline int read() {
	int res=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9') {
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')res=res*10+ch-48,ch=getchar();
	return res*f;
}
const int maxn = 600044;
struct edge {
	int from,to,nxt,val;
	bool operator<(const edge &rhs)const {
		return val<rhs.val;
	}
} e[maxn],ed[maxn],E[maxn];
struct node {
	int pos,dis;
	inline node(int p=0,int d=0) {
		pos=p;
		dis=d;
	}
	bool operator<(const node &rhs)const {
		return rhs.dis<dis;
	}
};
int head[maxn],Head[maxn],cnt,vis[maxn];
inline void add(int from,int to,int val) {
	e[++cnt].to=to;
	e[cnt].from=from;
	e[cnt].val=val;
	e[cnt].nxt=head[from];
	head[from]=cnt;
}
inline void Add(int from,int to,int val) {
	ed[++cnt].to=to;
	ed[cnt].val=val;
	ed[cnt].from=from;
	ed[cnt].nxt=Head[from];
	Head[from]=cnt;
}
int n,m,mark[maxn];
int dis[50][maxn],fa[maxn][30],Fa[maxn];
inline int find(int x) {
	if(x==Fa[x])return x;
	return Fa[x]=find(Fa[x]);
}
inline void Kruskal() {
	for(register int i=1; i<=n; i++)Fa[i]=i;
	sort(E+1,E+1+m);
	cnt=0;
	for(register int i=1; i<=m; i++) {
		int x=find(e[i].from),y=find(e[i].to);
		if(x!=y) {
			Fa[x]=y;
			Add(e[i].from,e[i].to,e[i].val);
			Add(e[i].to,e[i].from,e[i].val);
		} else {
			mark[e[i].from]=mark[e[i].to]=1;
		}
	}
}
int dep[maxn],d[maxn];
inline void dfs(int u,int father) {
	fa[u][0]=father;
	dep[u]=dep[father]+1;
	for(register int i=1; i<=20; i++)fa[u][i]=fa[fa[u][i-1]][i-1];
	for(register int i=Head[u]; i; i=ed[i].nxt) {
		int v=ed[i].to;
		if(v!=father)d[v]=d[u]+ed[i].val,dfs(v,u);
	}
}
inline int lca(int u,int v) {
	if(dep[u]<dep[v])swap(u,v);
	for(register int i=25; i>=0; i--)
		if(dep[fa[u][i]]>=dep[v])u=fa[u][i];
	if(u==v)return u;
	for(register int i=25; i>=0; i--) {
		if(fa[u][i]!=fa[v][i])u=fa[u][i],v=fa[v][i];
	}
	return fa[u][0];
}
priority_queue<node> q;
inline void dij(int s,int id) {
	for(register int i=1; i<=n; i++)dis[id][i]=0x7f7f7f7f;
	memset(vis,0,sizeof vis);
	dis[id][s]=0;
	q.push(node(s,0));
	while(!q.empty()) {
		int u = q.top().pos;
		q.pop();
		if(vis[u])continue;
		vis[u]=1;
		for(register int i=head[u]; i; i=e[i].nxt) {
			int v=e[i].to;
			if(dis[id][v]>dis[id][u]+e[i].val) {
				dis[id][v]=dis[id][u]+e[i].val;
				q.push(node(v,dis[id][v]));
			}
		}
	}
}
inline int dist(int u,int v) {
	return d[u]+d[v]-(d[lca(u,v)]*2);
}
signed main() {
	n=read();
	m=read();
	for(register int i =1,u,v,w; i<=m; i++) {
		u=read();
		v=read();
		w=read();
		add(u,v,w);
		add(v,u,w);
		E[i].from=u;
		E[i].to=v;
		E[i].val=w;
	}
	Kruskal();
	dfs(1,0);
	cnt=0;
	for(register int i=1; i<=n; i++)
		if(mark[i])
			dij(i,++cnt);
	int q=read();
	while(q--) {
		int u=read(),v=read();
		int ans=dist(u,v);
		for(register int i=1; i<=cnt; i++)
			ans=min(dis[i][u]+dis[i][v],ans);
		printf("%d\n",ans);
	}
	return 0;
}