#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const double INF = 1e18;
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
vector<double> dist(N, INF);
vector<vector<pair<int,int>>> adj(N);
for (int i = 0; i < M; ++i) {
adj[x[i]].push_back({y[i], c[i]});
adj[y[i]].push_back({x[i], c[i]});
}
priority_queue<pair<double,int>, vector<pair<double,int>>, greater<pair<double,int>>> pq;
arr[0] = 0;
pq.push({0, H});
while(!pq.empty()) {
int cur = pq.top().second;
double d = pq.top().first;
pq.pop();
if (dist[cur] < d) continue;
dist[cur] = d;
if (arr[cur] == 0) return d;
for (auto [nxt, cost] : adj[cur]) {
if (dist[nxt] > d + cost) {
dist[nxt] = d + cost;
pq.push({dist[nxt], nxt});
}
}
}
return -1;
}
