#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m, Q, head[100005], tot, fa[100005], ans, f[100005][25], d[100005];
int w[100005][25];
bool flag[100005];
queue <int> q;
struct jc {
	int x, y, z;
}a[1000005];
struct jcc {
	int ver, ed, net;
}e[1000005];
void add (int x, int y, int z) {
	e[++tot].ver = y;
	e[tot].ed = z;
	e[tot].net = head[x];
	head[x] = tot;
}
int find (int x) {
	if (fa[x] == x) return x;
	return fa[x] = find (fa[x]);
}
void hb (int x, int y) {
	fa[find (x)] = find (y);
}
bool cmp (jc x, jc y) {
	return x.z > y.z;
}
void kru () {
	sort (a + 1, a + 1 + m, cmp);
	for (int i = 1; i <= m; i++) {
		int xx = find (a[i].x);
		int yy = find (a[i].y);
		if (xx == yy) continue;
		hb (xx, yy);	
		add (a[i].x, a[i].y, a[i].z);
		add (a[i].y, a[i].x, a[i].z);
	}
	return ;
}
void bfs (int s) {
	flag [s] = 1;
	q.push (s);
	d[s] = 1;
	while (!q.empty ()) {
		int sum = q.front ();
		q.pop();
		for (int i = head[sum]; i ; i = e[i].net) {
			int yy = e[i].ver;
			if (d[yy]) continue;
			d[yy] = d[sum] + 1;
			w[yy][0] = e[i].ed;
			f[yy][0] = sum;
			for (int j = 1; (1 << j) <= n; j++) {
				f[yy][j] = f[f[yy][j - 1]][j - 1];
				w[yy][j] = min(w[yy][j - 1], w[f[yy][j - 1]][j - 1]);
			}
			q.push(yy);
		}
	}
}
int lca (int x, int y) {
	if(find (x) != find (y)) return -1;
	int ans = 2147483647;
	if (d[x] < d[y]) swap(x, y);
	for (int i = log2(n) + 1; i >= 0; i--)
		if (d[x] - (1 << i) >= d[y]) {
			ans = min (ans, w[x][i]);
			x = f[x][i];
		}
	if (x == y) return ans;
	for (int i = log2(n) + 1; i >= 0; i--)
		if (f[x][i] != f[y][i]) {
			ans = min (ans, min (w[x][i], w[y][i]));
			x = f[x][i];
			y = f[y][i];
		}
	ans = min (ans, min (w[x][0], w[y][0]));
	return ans;
}
signed main() {
	ios::sync_with_stdio(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) fa[i] = i;
	for (int i = 1; i <= m; i++) {
		int x, y, z;
		cin >> x >> y >> z;
		a[i].x = x;
		a[i].y = y;
		a[i].z = z;
	}
	kru ();
	for (int i = 1; i <= n; i++) {
		if (!flag[i]) {	
			d[i] = 1;
			bfs (i);	
			f[i][0] = i;
			w[i][0] = 2147483647;
		}
	}
	cin >> Q;
	for (int i = 1; i <= Q; i++) {
		int x, y;
		cin >> x >> y;
		int num = lca (x, y);
		if (num == 2147483647) cout << -1 << '\n';
		else cout << num << '\n';
	}
	return 0;
}