#pragma GCC opmize("Ofast", unroll-loops)
#include <bits/stdc++.h>
using namespace std;
#define name "TENBAI"
#define fi first
#define se second
#define endl '\n'
#define setmin(x, y) x = min((x), (y))
#define setmax(x, y) x = max((x), (y))
#define sqr(x) ((x) * (x))
#define all(x) x.begin(), x.end()
mt19937 hdp(chrono::high_resolution_clock::now().time_since_epoch().count());
int rand(int l, int r){return l + ((hdp() % (r - l + 1)) + r - l + 1) % (r - l + 1);}
const double inf = 1 / .0;
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> a)
{
setmin(K, 90);
vector<vector<double>> dist(N, vector<double>(K + 1, inf));
vector<vector<pair<int, int>>> g(N);
for (int i = 0; i < M; i++)
g[x[i]].push_back({y[i], c[i]}), g[y[i]].push_back({x[i], c[i]});
priority_queue<tuple<double, int, int>, vector<tuple<double, int, int>>, greater<>> pq;
dist[0][0] = 0;
pq.push({0, 0, 0});
while (pq.size())
{
auto u = get<1>(pq.top()), t = get<2>(pq.top());
double d = get<0>(pq.top());
pq.pop();
if (dist[u][t] != d || u == H)
continue;
for (pair<int, int> v : g[u])
{
if (dist[v.fi][t] > d + v.se)
{
dist[v.fi][t] = d + v.se;
pq.push({dist[v.fi][t], v.fi, t});
}
if (a[v.fi] == 0 && dist[v.fi][0] > 0)
{
dist[v.fi][0] = 0;
pq.push({dist[v.fi][0], v.fi, t});
}
if (a[v.fi] == 2 && t + 1 <= K && dist[v.fi][t + 1] > (d + v.se) / 2.0)
{
dist[v.fi][t + 1] = (d + v.se) / 2.0;
pq.push({dist[v.fi][t + 1], v.fi, t + 1});
}
}
}
double res = inf;
for (int i = 0; i <= K; i++)
setmin(res, dist[H][i]);
if (res == inf)
res = -1;
return res;
}
