// 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<vector<int>> d(n,vector<int>(h+1,-1));
    d[k][0]=INF;
    for(int j = 1;j<=h;j++){
        for(int i = 0;i<n;i++){
            d[i][j]=d[i][j-1];
            for(auto[node,w]:v[i]){
                d[i][j]=max(d[i][j],min(d[node][j-1],w));
            }
        }
    }
    for(int i = 0;i<n;i++){
        if(i==k)cout<<0<<endl;
        else cout<<d[i][h]<<endl;
    }
}