#include <bits/stdc++.h>
#define endl '\n'
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define fo(i,n) for(auto i =0 ; i < n;i++)
#define fore(i,l,r) for(auto i = l; i < r;i++)
#define forex(i,r,l) for(auto i = r; i >= l; i--)
#define ffo(i,n) forex(i,n-1,0)
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define sz(x) (int)x.size()
#define gcd(a,b) __gcd(a,b)
#define vii vector<ii>
using namespace std;
using ll = long long; using ull = unsigned long long;
using vi = vector<int>;using ii = pair<int,int>;using mii = map<int,int>;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define state pair<ll, int>
double solve(int N, int M, int K, int H, vi x, vi y, vi c, vi arr){
if(N==2)return *min_element(all(c));
// if(N==3){
// }
vector<vii> graph(N);
fo(i,M){graph[x[i]].pb({y[i], c[i]});graph[y[i]].pb({x[i], c[i]});}
vector<ll> minDist(N+1, 1e18),vis(N+1,0);
priority_queue<state, vector<state>, greater<state>> pq;
queue<int> q;q.push(0);pq.push({0,0});
while(!q.empty()){
auto nodo= q.front();q.pop();
if(nodo == H)continue;
if(arr[nodo] == 0)pq.push({0, nodo});
vis[nodo]=1;
for(auto [v,w] : graph[nodo])if(!vis[v])q.push(v);
}fill(all(vis) , 0);
while(!pq.empty()){
auto nodo = pq.top().s; auto actcost = pq.top().f;pq.pop();
// cout << nodo << " " << actcost << endl;
if(nodo == H) continue;
if(vis[nodo]) continue;vis[nodo]=1;
for(auto [v,w] : graph[nodo]){
if(actcost + w < minDist[v]) {
minDist[v] = actcost + w;
pq.push({actcost+w, v});
}
}
}
return (double)minDist[H];
}
