#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;
set<pair<int,pair<int,int> > > seged;

int main()
{
    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,0);
    seged.insert(make_pair(1e9,make_pair(0,k)));
    while(!seged.empty())
    {
        tav=seged.begin()->first;
        lepes=seged.begin()->second.first;
        csucs=seged.begin()->second.second;
        seged.erase(seged.begin());
        if(dp[csucs][lepes]>=tav) continue;
        index=lepes;
        while(index<=h && dp[csucs][index]<tav)
        {
            dp[csucs][index]=tav;
            ++index;
        }
        if(ki[csucs]==-1) ki[csucs]=tav;
        else ki[csucs]=max(ki[csucs],tav);
        if(lepes==h) continue;
        for(auto to:g[csucs])
        {
            if(dp[to.first][lepes+1]>=min(tav,to.second)) continue;
            seged.insert(make_pair(min(tav,to.second),make_pair(lepes+1,to.first)));
        }

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