#include <bits/stdc++.h>
using namespace std;
using ll = long long;
double solve(int n, int m, int k, int h, vector<int> x, vector<int> y, vector<int> c, vector<int> a) {
vector<pair<int, int>> v[n];
for(int i = 0; i < m; i++) {
v[x[i]].push_back({y[i], c[i]});
v[y[i]].push_back({x[i], c[i]});
}
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
vector<ll> dis(n, 1e18);
dis[0] = 0;
pq.push({0, 0});
while(!pq.empty()) {
ll x = pq.top().first;
int y = pq.top().second;
pq.pop();
if(dis[y] != x) continue;
for(pair<int, int> p : v[y]) {
int X = p.first;
int Y = p.second;
if(a[X] == 0 && dis[X] != 0) {
dis[X] = 0;
pq.push({0, X});
} else if(dis[X] > dis[y] + Y) {
dis[X] = dis[y] + Y;
pq.push({dis[X], X});
}
}
}
if(dis[h] == 1e18) {
return -1;
} else {
return dis[h];
}
}
//
//int main() {
// cout << solve(4, 4, 30, 3, {0, 0, 1, 2}, {1, 2, 3, 3}, {5, 4, 2, 4}, {1, 0, 2, 1}) << '\n';
//}
