#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
using namespace std;
#define ll long long
int n, m, k, q;
vector<pair<int, int> > adjl[75];
int adjm[75][75];
bool check(ll time, int c, int d){
queue<pair<int, pair<int, ll> > > q;
q.push(make_pair(c, make_pair(0, 0)));
while(!q.empty()){
pair<int, pair<int, int> > iii = q.front(); q.pop();
if(iii.second.first > k) continue;
if(iii.second.second > time) continue;
if(iii.first == d) return true;
for(int i = 0; i < (int)adjl[iii.first].size(); i++){
q.push(make_pair(adjl[iii.first][i].first, make_pair(iii.second.first + 1, iii.second.second + adjl[iii.first][i].second)));
}
}
return false;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
memset(adjm, -1, sizeof(adjm));
for(int i = 0; i < m; i++){
int a, b, t; cin >> a >> b >> t;
if(adjm[a][b] == -1) adjm[a][b] = t;
else adjm[a][b] = min(adjm[a][b], t);
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(adjm[i][j] != -1) adjl[i].push_back(make_pair(j, adjm[i][j]));
}
}
cin >> k >> q;
for(int i = 0; i < q; i++){
int c, d; cin >> c >> d;
ll lower = 0;
ll upper = 1000000000000;
while(lower < upper){
ll mid = (ll)(lower + upper) / 2;
if(check(mid, c, d))upper = mid;
else lower = mid + 1;
}
if(upper == 1000000000000 && !check(upper, c, d)) cout << -1;
else cout << lower;
cout << "\n";
}
}
