#include "bits/stdc++.h"
#include "cyberland.h"
using namespace std;
#define INF 2000000000
#define INFLL 3000000000000000000LL
#define ll long double
double solve(int N, int M, int K, int H, vector<int> x, vector<int> y, vector<int> c, vector<int> arr) {
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]});
}
long double dis2[N][min(K,40)+1];
long double dis[N][min(K,40)+1];
for(int i=0;i<N;i++){
for(int j=0;j<=min(K,41);j++){
dis2[i][j]=INFLL;
dis[i][j]=0;
}
}
priority_queue<pair<pair<long double,long double>,pair<int,int>>>q;
q.push({{-0,-0},{H,0}});
while(!q.empty()){
auto u=q.top();q.pop();
long long d1=-u.first.first;
long double d=-u.first.second;
int cur=u.second.first;
int k=u.second.second;
//cout<<dis[cur][k]<<" ";
if(dis2[cur][k]!=INFLL)continue;
//cout<<dis[cur][k]<<" ";
dis2[cur][k]=d1;
dis[cur][k]=d;
if(arr[cur]==2)k=min(min(K,41),k+1);
if(arr[cur]!=0&&cur!=0){
long double fact1=1<<k;
long double fact2=1<<max(k-30,0);
for(auto v:adj[cur]){
if(v.first==H)continue;
long double qw=d+v.second/fact1/fact2;
//cout<<qw<<" ";
int qwe=qw;
long double d2=qw-qwe;
ll d3=d1+qwe;
q.push({{-d3,-d2},{v.first,k}});
}
}
}
for(int i=0;i<N;i++){
for(int j=0;j<=min(K,41);j++){
long double d=dis2[i][j];
d+=dis[i][j];
//cout<<d<<" ";
}
//cout<<"\n";
}
queue<int>q2;
vector<bool>vis(N,0);
q2.push(0);
pair<ll,long double>mn={INFLL,0};
for(int i=0;i<=min(K,41);i++)mn=min(mn,{dis2[0][i],dis[0][i]});
while(!q2.empty()){
int cur=q2.front();
q2.pop();
if(vis[cur]||cur==H)continue;
vis[cur]=1;
if(arr[cur]==0)for(int i=0;i<=min(K,41);i++)mn=min(mn,{dis2[cur][i],dis[cur][i]});
for(auto u:adj[cur])q2.push(u.first);
}
if(mn.first==INFLL){
return -1;
}
else{
long double d2=mn.second;
long double ret=mn.first;
ret+=d2;
return ret;
}
return -1;
}
