#include <iostream>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>

using namespace std;

int n,m,k,h,a,b,c,tav,lepes,csucs,index;
vector<int>ki;
vector<vector<int> > dp;
vector<vector<pair<int,int> > > g;
priority_queue<pair<int,pair<int,int> > > seged;

int main()
{
    cin.tie(0);
	ios::sync_with_stdio(false);
    cin>>n>>m>>k>>h;
    ki.assign(n+1,-1);
    dp.assign(n+1,vector<int>(h+1,0));
    g.resize(n+1);
    while(m--)
    {
        cin>>a>>b>>c;
        g[a].push_back(make_pair(b,c));
        g[b].push_back(make_pair(a,c));
    }
    dp[k]=vector<int>(h+1,1e9);
    seged.push(make_pair(-1*1e9,make_pair(-1*0,k)));
    while(!seged.empty())
    {
        tav=-1*seged.top().first;
        lepes=-1*seged.top().second.first;
        csucs=seged.top().second.second;
        seged.pop();
        if(dp[csucs][lepes]>tav) continue;
        if(ki[csucs]==-1) ki[csucs]=tav;
        else ki[csucs]=max(ki[csucs],tav);
        if(lepes==h) continue;
        for(auto to:g[csucs])
        {
            a=min(tav,to.second);
            if(dp[to.first][lepes+1]>=a) continue;
            index=lepes+1;
            while(index<=h && dp[to.first][index]<a)
            {
                dp[to.first][index]=a;
                ++index;
            }
            seged.push(make_pair(-1*a,make_pair(-1*(lepes+1),to.first)));
        }

    }
    ki[k]=0;
    for(int i=1;i<=n;i++) cout<<ki[i]<<"\n";
    return 0;
}