#include "cyberland.h"
#include <bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(int i = a;i < b;i++)
#define ll long long
#define ii pair<ll,ll>
#define id pair<double,ll>
#define F first
#define S second
#define pb push_back
priority_queue<id,vector<id>,greater<id> >pq;
bool v[100005] = {0};
double dist[100005][31];
vector<vector<ii> >adj;
ll H;
void dfs(ll idx){
v[idx] = 1;
for(auto x:adj[idx]){
if(!v[x.F] && x.F != H){
dfs(x.F);
}
}
}
double solve(int n, int m, int k, int h, std::vector<int> x, std::vector<int> y, std::vector<int> c, std::vector<int> arr) {
double ans;
H = h;
adj.assign(n+5,vector<ii>());
f(i,0,n){
v[i] = 0;
f(j,0,k+1){
dist[i][j] = 1e18;
}
}
f(i,0,m){
adj[x[i]].pb(ii(y[i],c[i]));
adj[y[i]].pb(ii(x[i],c[i]));
}
dfs(0);
f(i,0,n){
if((arr[i] == 0 && v[i]) || i == 0){
pq.push(id(0,(k+1) * i));
dist[i][0] = 0;
}
}
while(!pq.empty()){
id f = pq.top();
pq.pop();
ll w = f.F,u = f.S / (k+1);
ll ek = f.S % (k+1);
if(dist[u][ek] < w){
continue;
}
if(arr[u] == 2 && ek+1 <= k && dist[u][ek+1] > dist[u][ek] / 2){
dist[u][ek+1] = dist[u][ek] / 2;
pq.push(id(dist[u][ek+1],(k+1)*u + ek+1));
}
for(auto x:adj[u]){
if(dist[x.F][ek] > dist[u][ek] + x.S){
dist[x.F][ek] = dist[u][ek] + x.S;
pq.push(id(dist[x.F][ek],(k+1) * x.F + ek));
}
}
}
ans = 1e18;
f(j,0,k+1){
ans = min(ans,dist[h][j]);
}
if(ans == 1e18){
ans = -1;
}
return ans;
}
