#include <bits/stdc++.h>
#include "cyberland.h"
using namespace std;
// #define int long long
#define ll long long
#define ff first
#define ss second
#define pint pair < ll , ll >
#define vint vector < int >
#define fast ios_base::sync_with_stdio(NULL); cin.tie(NULL)
const int inf = 1e9 + 9;
const int mxn = 2e5 + 2;
const int mod = 1e9 + 7;
vector < vector < pint > > adj(mxn);
ll dis[mxn];
double solve(int n , int m , int k , int H , vint x , vint y , vint c , vint arr) {
for (int i = 0; i < n; i++) {
adj[i].clear();
dis[i] = -2;
}
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]});
}
priority_queue < pint > q;
q.push({0 , H});
while (!q.empty()) {
pint p = q.top();
q.pop();
if (dis[p.ss] != -2) continue;
dis[p.ss] = -p.ff;
if (p.ss == 0) return dis[0];
for (pint i : adj[p.ss]) {
q.push({p.ff - i.ss , i.ff});
}
}
return -1;
}
// int main() {
// int n , m , k , h;
// cin >> n >> m >> k >> h;
// vint x(m) , y(m) , c(m) , arr(n);
// for (int i = 0; i < m; i++) cin >> x[i];
// for (int i = 0; i < m; i++) cin >> y[i];
// for (int i = 0; i < m; i++) cin >> c[i];
// for (int i = 0; i < n; i++) cin >> arr[i];
// cout << solve(n , m , k , h , x , y , c , arr) << '\n';
// }
