#include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct El
{
int sebesseg;
int cel;
int tav;
bool operator<(const El&other)const
    {
    return tav<other.tav;
    }
};
int main()
{
    int n,m,start,len;
    cin>>n>>m>>start>>len;
    vector<vector<pair<int,int>>> graph(n+1);
    int a,b,c;
    for(int i=0;i<m;i++)
        {
        cin>>a>>b>>c;
        graph[a].push_back({b,c});
        graph[b].push_back({a,c});
        }
    priority_queue<El> q;
    vector<int> ans(n+1,-1);
    ans[start]=0;
    El d;
    vector<bool> vis(n+1,false);
    for(auto [cel,seb]:graph[start])
        {
        d.sebesseg=seb;
        d.cel=cel;
        d.tav=1;
        q.push(d);

        }
    while(q.size())
        {
        El u=q.top();
        q.pop();
        if(ans[u.cel]>u.sebesseg)continue ;
        if(u.tav>len)continue;
        ans[u.cel]=u.sebesseg;
        for(auto [cel,seb]:graph[u.cel])
            {
            d.sebesseg=min(ans[u.cel],seb);
            d.cel=cel;
            d.tav=u.tav+1;
            q.push(d);
            }
        }
    for(int i=1;i<=n;i++)
        if(i!=start)
            cout<<ans[i]<<"\n";
        else
            cout<<"0\n";
    return 0;
}