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

#define fi first
#define se second

int main() {
    int n, m, k, h;
    cin >> n >> m >> k >> h;
    vector<vector<int>> dp(n+1, vector<int>(h+1, 0));
    dp[k][0]=100000;
    vector<pair<int, pair<int, int>>> elek;
    for (int i = 1; i <= m; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        elek.push_back({c, {a, b}});
    }
    sort(elek.rbegin(), elek.rend());
    for (int i = 1; i <= h; i++) {
        for (auto p : elek) {
            auto [a, b] = p.second;
            dp[a][i]=max(min(p.fi, dp[b][i-1]), dp[a][i]);
            dp[b][i]=max(min(p.fi, dp[a][i-1]), dp[b][i]);
        }
    }
    for (int i = 1; i <= n; i++) {
        if (i==k) {
            cout << 0 << '\n';
            continue;
        }
        int maxi = 0;
        for (int j = 0; j <= h; j++) {
            maxi=max(maxi,dp[i][j]);
        }
        cout<<maxi<<'\n';
    }
}