#include <bits/stdc++.h>

using namespace std;

int main()
{
    
    int n, m, k, h;
    cin >> n >> m >> k >> h;
    vector<vector<pair<int, int>>> adj(100005);
    vector<int> dist(100005, -1), dist2(100005, -1);
    
    dist[k] = INT_MAX;
    dist2[k] = INT_MAX;
    
    for(int i = 0;i < m;i++ ) {
        int a, b, c;
        cin >> a >> b >> c;
        adj[a].push_back({b, c});
        adj[b].push_back({a, c});
    }

    // belman-ford algorithm
    
    for(int i = 0;i < h;i++ ) { //the maximum amount height
        for(int j = 1;j <= n;j++ ) { // using dp and belman ford algorithm
            for(int k = 0;k <= adj[j].size();k++ ) { 
                if(dist[adj[j][k].first] < min(adj[j][k].second, dist2[j])) {
                    dist[adj[j][k].first] = min(adj[j][k].second, dist2[j]);
                    //cout << dist[adj[j][k].first] << ' ' << min(dist[adj[j][k].second], dist2[j])<< endl;
                }
            }
        }
        dist2 = dist;
    }
    dist[k] = 0;
    
    for(int i = 1;i<=n;i++ ) {
        cout << dist[i] << endl;
    }
    
    
    return 0;
}