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

const int maxn = 310,  inf = 0x3f3f3f3f;

int n, m, l;
int g[maxn][maxn], f[maxn][maxn];

void floyd(int d[maxn][maxn]) {
	for (int k = 1; k <= n; k++)
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++)
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}

int main() {
	cin >> n >> m >> l;
	memset(g, 0x3f, sizeof(g));
	for (int i = 1; i <= m; ++i) {
		int u, v, w;
		cin >> u >> v >> w;
		g[u][v] = g[v][u] = w;
	}
	floyd(g);
	memset(f, 0x3f, sizeof(f));
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= n; j++)
			if (g[i][j] <= l)
				f[i][j] = 1;
	floyd(f);
	int q;
	cin >> q;
	while (q--) {
		int u, v;
		cin >> u >> v;
		cin >> u >> v;
		cout << (f[u][v] == inf ? -1 : f[u][v] - 1) << endl;
	}
	return 0;
}