// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
#define int long long

const int INF = 1e12;

signed main() {
    int n,m,k,h;cin>>n>>m>>k>>h;
    vector<vector<pair<int,int>>> v(n);
    k--;
    for(int i = 0;i<m;i++){
        int a,b,c;cin>>a>>b>>c;
        v[--a].push_back({--b,c});
        v[b].push_back({a,c});
    }
    vector<int> d(n,-1);
    d[k]=INF;
    priority_queue<array<int,3>> q;
    q.push({INF,0,k});
    while(!q.empty()){
        auto [mx,c,u]=q.top();
        q.pop();
        if(d[u]>mx)continue;
        for(auto [i,w] : v[u]){
            if(d[i]<min(d[u],w)&&c+1<=h){
                d[i]=min(d[u],w);
                q.push({d[i],c+1,i});
            }
        }
    }
    d[k]=0;
    for(int i : d)cout<<i<<endl;    
}