#include <bits/stdc++.h>
using namespace std;
#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second
const int M = 1e9+7;
const int inf = 1e18;
int bp(int x, int y, int p){
int res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int MI(int n, int p){
return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
return x * 1ull * y % p;
}
int di(int x,int y, int p){
return mul(x, MI(y, p), p);
}
int n , m , k , q;
int mat[71][71];
void dij(int u,int v,int k){
priority_queue<vector<int>>pq;
pq.push({u,0,0});
vector<int>dis(n+1,inf);
dis[u] = 0;
while(pq.size()){
vector<int>x = pq.top();
// print(x);
pq.pop();
if(x[2]+1 > k){
continue;
}
if(dis[x[0]] < x[1]){
continue;
}
int tu = x[0];
int di = x[1];
int ec = x[2];
for(int i = 1;i<=n;i++){
if(i == tu)continue;
if(dis[i] > di+mat[tu][i]){
dis[i] = di+mat[tu][i];
pq.push({i,dis[i],ec+1});
}
}
}
if(dis[v] == inf){
cout<<-1<<endl;
}
else{
cout<<dis[v]<<endl;
}
}
void solve(int testcase_number){
cin>>n>>m;
for(int i =0 ;i<=n;i++){
for(int j = 0;j<=n;j++){
mat[i][j] = inf;
}
}
for(int i = 0;i<m;i++){
int u,v,w;
cin>>u>>v>>w;
mat[u][v] = min(mat[u][v],w);
mat[v][u] = mat[u][v];
}
cin>>k>>q;
// k = min(k,n);
// cout<<k<<endl;
while(q--){
int u,v;
cin>>u>>v;
dij(u,v,k);
}
}
signed main(){
ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
cin.tie(0), cout.tie(0);
cout << fixed<<setprecision(9);
int t = 1;
// cin>>t;
for(int i = 1;i<=t;i++){
solve(i);
}
}
