// author : anhtun_hi , nqg
// 25-26.12.2024
#include <bits/stdc++.h>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v) memset(h, v, sizeof h)
#define Forv(i, a) for(auto& i : a)
#define For(i, a, b) for(int i = a; i <= b; ++i)
#define Ford(i, a, b) for(int i = a; i >= b; --i)
#define c_bit(i) __builtin_popcountll(i)
#define Bit(mask, i) ((mask >> i) & 1LL)
#define onbit(mask, i) ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
#define Log2(x) (63 - __builtin_clzll(x))
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
using db = long double;
using ull = unsigned long long;
namespace std {
template <typename T, int D>
struct _vector : public vector <_vector <T, D - 1>> {
static_assert(D >= 1, "Dimension must be positive!");
template <typename... Args>
_vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
};
template <typename T> struct _vector <T, 1> : public vector <T> {
_vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
};
template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = 70 + 5;
const ll mod = 1e9 + 7;
const ll oo = 1e18;
//#define int long long
int n, m, k, q;
ll w[MAXN][MAXN], dp[MAXN][MAXN][MAXN * MAXN];
void Solve() {
cin >> n >> m;
reset(w, 0x3f), reset(dp, 0x3f);
For(i, 1, m){
int u, v; ll c;
cin >> u >> v >> c;
minimize(w[u][v], c);
minimize(dp[u][v][1], c);
}
For(i, 1, n) w[i][i] = 0, dp[i][i][0] = 0;
cin >> k >> q;
For(d, 2, min(k, n))
For(a, 1, n) For(b, 1, n)For(c, 1, n){
minimize(dp[a][b][d], dp[a][c][d - 1] + w[c][b]);
}
while (q--){
int u, v;
cin >> u >> v;
ll ans = 0x3f3f3f3f3f3f3f3f; //cerr << ans << '\n';
For(i, 0, min(k, n)) minimize(ans, dp[u][v][i]);
if(ans == 0x3f3f3f3f3f3f3f3f) ans = -1;
cout << ans << '\n';
}
}
signed main() {
cin.tie(0) -> sync_with_stdio(0);
if(fopen("a.inp", "r")) {
freopen("a.inp", "r", stdin);
freopen("a.out", "w", stdout);
}
int t = 1;
// cin >> t;
while(t --) Solve();
return 0;
}
