#include <bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(int i=k; i<n; i++)
#define ll long long
const int inf = INT_MAX;

void solve()
{
    int n,m,k,h;
    cin>>n>>m>>k>>h;
    vector<vector<pair<int,int>>> g(n+1);
    vector<int> d(n);
    int a,b,w;
    f(i,0,m)
    {
        cin>>a>>b>>w;
        g[a].push_back({b,w});
        g[b].push_back({a,w});
    }  
    f(i,0,n)    d[i]=0;
    d[k-1]=0;
    f(i,1,h+1)
    {
        f(j,1,n+1)
        {
            int maxi=d[j];
            for(auto e : g[j])
            {
                int a=j;
                int b=e.first;
                int w=e.second;
                if(d[a]>0)  maxi=max(maxi, min(d[a],w));
                else    maxi=max(maxi,w);
            }
            d[j]=maxi;
        }
    }
    f(i,1,n+1)
    {
        if(i==k)    cout<<0<<"\n";
        else    cout<<d[i]<<"\n";
    }

}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}