#include <bits/stdc++.h>

using namespace std;

struct el{
    int k, v, e;
};

struct compare{
    bool operator()(el p1, el p2)
    {
        return p1.e < p2.e;
    }
};

int main()
{
    //ifstream cin("in.txt");

    int n, m, k, h;
    cin >> n >> m >> k >> h;

    vector<vector<el>> sz(n+1);

    for(int i=1; i<=m; i++){
        el a;
        cin>>a.k>>a.v>>a.e;

        sz[a.k].push_back(a);

        swap(a.k, a.v);
        sz[a.k].push_back(a);
    }

    priority_queue <el, vector<el>, compare> elek;

    for(el x:sz[k]) elek.push(x);

    vector<int> ans(n + 1, -1);
    vector<pair<int, int>> akt(n + 1);
    vector<bool> lattam(n+1);
    lattam[k] = 1;
    ans[k] = 1e5+1;
    while(!elek.empty()){
        el x;
        x = elek.top();
        elek.pop();

         if(akt[x.k].second + 1 <= h && !lattam[x.v]){
            akt[x.v].first = min(ans[x.k], x.e);
            akt[x.v].second = akt[x.k].second + 1;

            if(ans[x.v] == -1){
                ans[x.v] = max(akt[x.v].first, ans[x.v]);
            }

            lattam[x.v] = 1;
            for(el y:sz[x.v]) {
                if(!lattam[y.v]){
                    elek.push(y);
                }
            }
        }
        else{
            lattam[x.k] = 0;
        }
    }
    ans[k] = 0;
    for(int i = 1; i <= n; i++){
        cout << ans[i] << '\n';
    }













    return 0;
}