#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
using ll = long long;
const int INF = 1e9 + 7;
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>>> adj(N);
for (int i = 0; i < M; i++)
{
adj[x[i]].emplace_back(y[i], c[i]);
adj[y[i]].emplace_back(x[i], c[i]);
}
queue<int> Q;
vector<bool> vis(N);
Q.push(0);
vis[0] = 1;
while (!Q.empty())
{
int u = Q.front();
Q.pop();
for (pair<int, double> i : adj[u])
if (!vis[i.F] && i.F != H)
{
vis[i.F] = 1;
Q.push(i.F);
}
}
priority_queue<pair<double, int>, vector<pair<double, int>>, greater<pair<double, int>>> PQ;
vector<double> dist(N, 1e18);
for (int i = 1; i < N; i++)
if (vis[i] && !arr[i])
{
dist[i] = 0;
PQ.emplace(0, i);
}
dist[0] = 0;
PQ.emplace(0, 0);
while (!PQ.empty())
{
double d;
int u;
tie(d, u) = PQ.top();
PQ.pop();
if (d != dist[u])
continue;
for (pair<int, double> i : adj[u])
{
int v;
double w;
tie(v, w) = i;
if (dist[v] > dist[u] + w)
PQ.emplace(dist[v] = dist[u] + w, v);
}
}
for (int i = 1; i < N; i++)
if (arr[i] == 2 && vis[i])
{
double mn = 1e18;
for (pair<int, double> j : adj[i])
mn = min(mn, j.S);
if (mn < dist[i])
for (int j = 0; j < K; j++)
dist[i] = (dist[i] + mn) / 2.0;
PQ.emplace(dist[i], i);
}
else if (arr[i] == 0 && vis[i])
PQ.emplace(dist[i], i);
else
dist[i] = 1e18;
dist[0] = 0;
PQ.emplace(0, 0);
while (!PQ.empty())
{
double d;
int u;
tie(d, u) = PQ.top();
PQ.pop();
if (d != dist[u])
continue;
for (pair<int, ll> i : adj[u])
{
int v;
double w;
tie(v, w) = i;
if (dist[v] > dist[u] + w)
PQ.emplace(dist[v] = dist[u] + w, v);
}
}
return (dist[H] == 1e18 ? -1.0 : double(dist[H]));
}
