#include <bits/stdc++.h>
#include <queue>
using namespace std;

vector <vector <pair<int,int>>> graf;
vector <int> dist;
vector <int> tavok;
vector <int> parent;
int tav = 0;

void bfs(int p, int h){
    priority_queue<pair<int,int>> pq;
    // , vector<pair<int,int>>, greater<pair<int,int>>
    pq.push({INT_MAX,p});
    tavok[p] = INT_MAX;
    parent[p] = p;
    while(!pq.empty()){
        auto csucs = pq.top();
        pq.pop();
        tavok[csucs.second] = max(min(tavok[parent[csucs.second]],csucs.first),tavok[csucs.second]);
        dist[csucs.second] = dist[parent[csucs.second]] + 1;
        cerr << csucs.second << ' ' << tavok[csucs.second] << '\n';

        if(dist[csucs.second] > h){
            continue;
        }

        for(auto x : graf[csucs.second]){
            if(tavok[x.second] == 0){
                
                
                pq.push(x);
                parent[x.second] = csucs.second;
                
                
            }
            //cerr << x.second << ' ' << tavok[x.second] << '\n';

            
        }
        cerr << '\n';
    }
}

int main() {
	int n,m,k,h; cin >> n >> m >> k >> h;
    int a,b,c;
    graf.resize(n+1);
    dist.resize(n+1,0);
    tavok.resize(n+1,0);
    parent.resize(n+1,0);
    for(int i = 0; i < m; i++){
        cin >> a >> b >> c;
        graf[a].push_back({c,b});
        graf[b].push_back({c,a});
    }
    bfs(k, h);
    for(int i = 1; i <=n; i++){
        if(tavok[i] == INT_MAX){
            cout << 0 << '\n';
        }else
        cout << tavok[i] << '\n';
    }
}