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

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n,m,k,h; cin>>n>>m>>k>>h;
    vector<vector<array<int, 2>>> adj(n+1);
    while(m--)
    {
        int a,b,w; cin>>a>>b>>w;
        adj[a].push_back({b,w});
        adj[b].push_back({a,w});
    }
    int inf=1e9+20;
    vector<vector<int>> dist(n+1, vector<int> (h+1, -1));
    priority_queue<array<int, 3>> q;
    dist[k][0]=0;
    q.push({0,0,k});
    while(!q.empty())
    {
        auto [tav,db,cs]=q.top();
        db=abs(db);
        q.pop();
        if(tav!=dist[cs][db] || db==h) continue;
        for(auto &[i,w]:adj[cs])
        {
            int p=min(w,tav);
            if(db==0) p=w;
            if(p>dist[i][db+1])
            {
                dist[i][db+1]=p;
                q.push({dist[i][db+1],-(db+1),i});
            }
        }
    }
    for(int i=1; i<=n; i++)
    {
        int maxi=0;
        for(int &x:dist[i])
            maxi=max(maxi,x);
        cout<<(i==k?0:maxi)<<"\n";
    }
}