#include <bits/stdc++.h>
long long h;
std::vector<bool> visited;
std::vector<std::vector<std::pair<long long , long long>>> adj;
void dfs(long long nd){
if(visited[nd]) return;
visited[nd]=true;
if(nd==h) return;
for(auto i:adj[nd]) dfs(i.first);
}
double solve(int N, int M, int K, int H, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr){
visited.clear();
visited.resize(N,0);
adj.clear();
adj.resize(N);
h=H;
dfs(0);
for(int i = 0; i < M ; i++) adj[x[i]].push_back({y[i],c[i]});
for(int i = 0; i < M ; i++) adj[y[i]].push_back({x[i],c[i]});
std::vector<long double> dist(N,-1);
std::priority_queue<std::pair<long double,long long>> pq;
dist[H]=0;
pq.push({0,H});
while(!pq.empty()){
std::pair<long double,long long> nd = pq.top(); pq.pop();
nd.first*=-1;
if(dist[nd.second]<nd.first&&dist[nd.second]!=-1) continue;
//std::cout<<nd.first<<" "<<nd.second<<'\n';
for(auto dat:adj[nd.second]){
if(dist[dat.first]>dist[nd.second]+dat.second||dist[dat.first]==-1){
dist[dat.first]=dist[nd.second]+dat.second;
pq.push({dist[dat.first]*-1,dat.first});
}
}
}
long double res = dist[0];
if(res==-1) return res;
for(int i = 0; i < N; i++) if(arr[i]==0&&visited[i]) res=std::min(res,dist[i]);
return dist[0];
}
