//#pragma GCC optomize ("Ofast")
//#pragma GCC optomize ("unroll-loops")
//#pragma GCC target ("avx,avx2,fma")
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define sz size
#define cl clear
#define ins insert
#define ers erase
#define pii pair < int , int >
#define pll pair< long long , long long >
#define all(x) x.begin() , x.end()
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define tostr(x) to_string(x)
#define tonum(s) atoi(s.c_str())
#define seon(x) setprecision(x)
#define bpop(x) __builtin_popcount(x)
#define deb(x) cerr << #x << " = " << x << endl;
#define int ll
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
const double PI = 3.14159265;
const ll N = 1e5+5;
const ll mod = 1e9+7;
const ll inf = 1e9;
const ll INF = 1e18;
using namespace std;
ll n , m , q;
ll dp[N];
vector<pll> g[N];
void bfs(){
set<pll> st;
int k;
cin >> k;
for(int i = 1; i <= n; i++) dp[i] = inf;
for(int i = 1; i <= k; i++) {
int u;
cin >> u;
dp[u] = 0;
st.ins({0 , u});
}
while(st.sz()){
int v = st.begin()->S;
st.ers(st.begin());
for(pii to : g[v]){
if(dp[to.F] > dp[v]+to.S){
st.ers({dp[to.F] , to.F});
dp[to.F] = dp[v]+to.S;
st.ins({dp[to.F] , to.F});
}
}
}
}
ll road[N];
ll mx = 0 , B;
void dfs(int v , int d){
road[v] = d;
if(v == B) mx = max(mx , d);
for(pll to : g[v]){
if(road[to.S] < min(d , dp[to.S])) dfs(to.S , min(d , dp[to.S]));
}
}
void solve(){
cin >> n >> m;
for(int i = 1; i <= m; i++){
int a, b , c;
cin >> a>> b >> c;
g[a].pb({b , c});
g[b].pb({a , c});
}
bfs();
int q;
cin >> q;
int i;
cin >> i >> B;
dfs(i , dp[i]);
cout << mx <<"\n";
}
signed main(){
ios;
solve();
return 0;
}
/*
*/
