/// Template path: /home/mohammed/.config/sublime-text-3/Packages/User

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

// typedef
typedef long long ll;
typedef long double ld;
typedef vector<int> vecint;
typedef vector<char> vecchar;
typedef vector<string> vecstr;
typedef vector<long long> vecll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

// Marcos
#define endl ("\n")
#define int long long
#define mod 1000000007
#define pi (3.141592653589)
#define REP(i,a,b) for (int i = a; i < b; i++)
#define RREP(i,a,b) for (int i = a; i > b; i--)
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)

// Functions
long long squared(long long x) {return (x * x) % mod;}
int factorial(int n) {long long res = 1; for (int i = 1; i <= n; i++) {res = ((res * i) % mod + mod) % mod ;} return res;}
long long power(long long x, long long p) {if (p == 0) {return 1;} if (p % 2 == 1) {return (power(x, p - 1) * x) % mod;} return squared(power(x, p / 2));}

// cout << fixed;
// cout << setprecision(4);


// ---------(^_^)--------- //


vector<vector<vector<int>>> edg;
vector<int> cost;
vector<int> vis;
void dfs(int idx, int c) {
	cost[idx] = c;
	for (auto &i : edg[idx]) {
		if (vis[i[0]]) continue;
		vis[i[0]]++;
		dfs(i[0], c + i[1]);
		vis[i[0]]--;
	}


}



void main_solve() {

	int n, e, k; cin >> n >> e >> k;
	cin >> k;
	cost.resize(n, -1);
	vis.resize(n);
	edg.resize(n);
	for (int i = 0; i < e; i ++) {
		int a, b, c; cin >> a >> b >> c;
		edg[b].push_back({a, c});
	}
	vis[k]++;
	dfs(k, 0);
	int q; cin >> q;
	while (q--) {
		int s, p1, p2, p3, p4, p5;
		cin >> s >> p1 >> p2 >> p3 >> p4 >> p5;
		cout << cost[s] << endl;
	}
}


int32_t main() {

	fast;
// #ifndef ONLINE_JUDGE
// 	freopen("input.txt", "r", stdin);
// 	freopen("output.txt", "w", stdout);
// #endif
	// Just another problem (-_-)

	int t;
	t = 1;
	// cin >> t;

	while (t--) {
		main_solve();
	}


}