#include using namespace std; #define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++) #define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define el '\n' #define spa " " #define Yes cout << "Yes" << el #define No cout << "No" << el #define YES cout << "YES" << el #define NO cout << "NO" << el #define eps (1e-10) #define Equals(a,b) (fabs((a) - (b)) < eps ) #define debug(x) cerr << #x << " = " << x << el using ll = long long; using ull = unsigned long long; using pii = pair; using pll = pair; using vi = vector; using vl = vector; using vvl = vector>; using vs = vector; using vb = vector; const double pi = 3.141592653589793238; const int inf = 1073741823; const ll infl = 1LL << 60; const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string abc = "abcdefghijklmnopqrstuvwxyz"; const ll MOD = 998244353; #include using namespace atcoder; using mint = modint998244353; using vm = vector; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll n,m,l,s,e;cin>>n>>m>>l>>s>>e; vector> G(n); rep(i,0,m){ ll a,b,t;cin>>a>>b>>t; a--;b--; G[a].push_back({b,t}); G[b].push_back({a,t}); } vl T(l); rep(i,0,l)cin>>T[i]; for(auto &t:T)t--; vl dist1(n,infl),dist2(n,infl); priority_queue,greater> pq; pq.push({0,0}); while(!pq.empty()){ auto[cost,now]=pq.top();pq.pop(); if(dist1[now]<=cost)continue; dist1[now]=cost; for(auto [to,d]:G[now]){ if(dist1[to]>cost+d){ pq.push({cost+d,to}); } } } pq.push({0,n-1}); while(!pq.empty()){ auto[cost,now]=pq.top();pq.pop(); if(dist2[now]<=cost)continue; dist2[now]=cost; for(auto [to,d]:G[now]){ if(dist2[to]>cost+d){ pq.push({cost+d,to}); } } } ll ans=infl; for(auto t:T){ if(dist1[t]