#include<bits/stdc++.h>
#define ll long long
#define x first
#define y second
#define MK(x,y) make_pair((x),(y))
using namespace std;
const int N=505;
const ll inf=2e9;
vector<pair<int,int>> v[N];
int n,m,s,k;
int in[N],out[N],sum[N];
int f[N],mx[N],mi[N];
ll ans;
int T;
int find(int x){return f[x]==x?x:f[x]=find(f[x]);}
void work(){
  ans=0;
  for(int i=1;i<=n;i++)in[i]=out[i]=sum[i]=mx[i]=0,v[i].clear();
  cin>>m>>n>>k>>s;in[s]++;
  for(int i=1,x,y,z;i<=m;i++){
    cin>>x>>z>>y;
    ans+=z,in[y]++,out[x]++;
    v[x].push_back(MK(z,y));
  }
  for(int i=1,x;i<=k;i++)cin>>x,in[x]++;
  for(int i=1;i<=n;i++){
    f[i]=i;mi[i]=inf;
    sort(v[i].begin(),v[i].end());reverse(v[i].begin(),v[i].end());
    while(out[i]>in[i])ans-=v[i].back().x,mx[i]=max(mx[i],v[i].back().x),out[i]--,v[i].pop_back();
  }
  for(int i=1;i<=n;i++)
    for(auto j:v[i])f[find(i)]=find(j.y);
  for(int i=1;i<=n;i++){
    int x=find(i);
    sum[x]+=out[i]-in[i];
    if(v[i].size())mi[x]=min(mi[x],v[i].back().x-mx[i]);
  }
  for(int i=1;i<=n;i++)if(find(i)==i&&!sum[i]&&mi[i]!=inf)ans-=mi[i];
  cout<<ans<<'\n';
}
signed main(){
  ios::sync_with_stdio(0);
  cin.tie(0),cout.tie(0);
  cin>>T;
  while(T--)work();
  return 0;
}