// Hálózati átvitel.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

#include <iostream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m, k, h;
    cin >> n >> m >> k >> h;
    vector<vector<pair<int,int>>> adj(n + 1);
    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 });
    }
    vector<int> mini(n + 1, -1);
    mini[k] = 0;
    queue<pair<int, pair<int, int>>> q;
    q.push({ 0,{k,INT_MAX} });
    while (!q.empty())
    {
        auto it = q.front();
        q.pop();
        int stops = it.first;
        int node = it.second.first;
        int speed = it.second.second;
        if (stops > h) continue;
        for (auto iterator : adj[node])
        {
            int adjNode = iterator.first;
            int curSpeed = iterator.second;
            if (min(speed, curSpeed) > mini[adjNode])
            {
                mini[adjNode] = min(speed, curSpeed);
                q.push({ stops + 1,{adjNode,mini[adjNode]} });
            }
        }
    }
    for (int i = 1; i <= n; i++)
    {
        if (i != k)
            cout << mini[i] << endl;
        else
            cout << 0 << endl;
    }
       

}