#include<bits/stdc++.h>
#define pb push_back
using namespace std;
double solve (int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
vector<vector<pair<int, double>>> edge(N);
for (int i = 0; i < M; i ++) {
edge[x[i]].pb({y[i], c[i]});
edge[y[i]].pb({x[i], c[i]});
}
priority_queue<pair<double, int>> pq;
vector<int> visited(N, 0);
vector<double> dist(N, 1e19);
dist[0] = 0;
pq.push({0, 0});
// dist[H] = 0;
// pq.push({0, H});
// for (int i = 0; i < N; i ++) {
// if (arr[i] == 0) {
// dist[i] = 0;
// pq.push({0, i});
// }
// }
while (!pq.empty()) {
int v = pq.top().second; pq.pop();
// cout << v << endl;
visited[v] ++;
if (v == H) continue;
for (auto [u, w] : edge[v]) {
if (visited[u] >= 2) continue;
if (dist[v] + w < dist[u]) {
dist[u] = dist[v] + w;
if (arr[u] == 0) {dist[u] = 0;}
pq.push({ (dist[u]*(-1)) , u});
}
}
}
// if (dist[0] == 1e19) {return (double)-1;}
// return (double)dist[0];
if (dist[H] == 1e19) {return (double)-1;}
return (double)dist[H];
}
