#include <iostream>
#include<algorithm>
#include<vector>

using namespace std;

int n,m,k,h,a,b,c;
vector<vector<pair<int,int> > > g;
vector<int>cost1;
vector<int>cost2;

void f()
{
    while(h--)
    {
        for(int node=1;node<=n;node++)
        {
            for(auto to:g[node])
            {
                cost2[to.first]=max(cost2[to.first],min(to.second,cost1[node]));
            }
        }
        cost1=cost2;
    }
}

int main()
{
    cin>>n>>m>>k>>h;
    g.resize(n+1);
    cost1.assign(n+1,-1);
    cost2.assign(n+1,-1);
    while(m--)
    {
        cin>>a>>b>>c;
        g[a].push_back({b,c});
        g[b].push_back({a,c});
    }
    cost1[k]=1e9;
    cost2[k]=1e9;
    f();
    cost1[k]=0;
    for(int i=1;i<=n;i++) cout<<cost1[i]<<"\n";
    return 0;
}