#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

void solve()
{
	int n, m, k, s;
	cin >> n >> m >> k >> s;
	vector<tuple<int, int, int>> v(m);
	FOR (i, 0, m)
	{
		int a, b, c;
		cin >> a >> b >> c;
		v[i] = {a, b, c};
	}
	FOR (i, 0, k)
	{
		int c;
		cin >> c;
		int a = 0, b = 0;
		v.PB({a, b, c});
	}
	int ans = 0;
	sort(ALL(v));
	do
	{
		int res = 0;
		int t = s;
		for (auto [a, b, c] : v)
		{
			if (t == a)
				res += b;
			t = c;
		}
		ans = max(ans, res);
	} while(next_permutation(ALL(v)));
	cout << ans << '\n';
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	
	return 0;
}