#include <iostream>
#include <vector>
#include <queue>
/*#include <fstream>
#define cin fin
std::ifstream fin("be2.txt");*/
using namespace std;

struct csucs{
    vector<pair<int, int>> szomszed;
    int maxsebesseg=-1;
    bool q=0;
    int dp[101];
};

int x, y, z, n, m, k, h;
csucs a[10000];
queue<int> q;

int main()
{
    cin >> n >> m >> k >> h;
    k--;
    for(int i=0; i<m; i++){
        cin >> x >> y >> z;
        x--;
        y--;
        a[x].szomszed.push_back(make_pair(y, z));
        a[y].szomszed.push_back(make_pair(y, z));
        for(auto& it:a[i].dp){
            it=0;
        }
    }
    a[k].maxsebesseg=1000000;
    a[k].dp[0]=1000000;
    q.push(k);
    while(!q.empty()){
        x=q.front();
        a[x].q=0;
        //cout << x+1 << " -> ";
        q.pop();
        for(pair<int, int>& it:a[x].szomszed){
            int speed=it.second;
            bool push=0;
            y=it.first;
            for(int i=0; i<h; i++){
                if(min(a[x].dp[i], speed)>a[y].dp[i+1]){
                    a[y].dp[i+1]=min(a[x].dp[i], speed);
                    push=1;
                    a[y].maxsebesseg=max(a[y].maxsebesseg, a[y].dp[i+1]);
                }
            }
            if(push&&!a[y].q){
                q.push(y);
                a[y].q=1;
            }
            /*if(min(a[x].sebesseg, it.second)>a[it.first].sebesseg&&a[x].tav<h){
                a[it.first].sebesseg=min(a[x].sebesseg, it.second);
                a[it.first].tav=a[x].tav+1;
                q.push(it.first);
            }*/
        }
    }
    a[k].maxsebesseg=0;
    for(int i=0; i<n; i++){
        cout << a[i].maxsebesseg << '\n';
    }
    return 0;
}