#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<long long> dj(vector<vector<pair<int, int>>> g, int start, int except){
vector<long long> dist(g.size(), 1e18);
dist[start] = 0;
priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<>> pq;
pq.push({0, start});
while(pq.size()){
auto [d, cur] = pq.top();
pq.pop();
if (dist[cur]!=d) continue;
for (auto [e, w]: g[cur]){
if (dist[e]>d+w && e!=except){
dist[e] = d+w;
pq.push({dist[e], e});
}
}
}
return dist;
}
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){
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]});
}
vector<long long> d1 = dj(g, 0, H);
vector<long long> d2 = dj(g, H, -1);
long long res = d2[0];
for (int i = 0; i<N; i++){
if (arr[i]==0 && d1[i]<1e18) res = min(res, d2[i]);
}
if (res==1e18) res = -1;
return res;
}
// int main() {
// cout<<solve(4, 4, 30, 3, {0, 0, 1, 2}, {1, 2, 3, 3}, {5, 4, 2, 4}, {1, 0, 2, 1});
// }
