#include <bits/stdc++.h>

using namespace std;

const int INF = 2e9 + 7;

struct el{
    int a;
    int b;
    int c;
};

int main(){
    int n, m, k, h;
    cin >> n >> m >> k >> h;
    k--;

    vector<el> elek(m);
    for(int i = 0; i < m; i++){
        cin >> elek[i].a >> elek[i].b >> elek[i].c;
        elek[i].a--; elek[i].b--;
    }

    vector<vector<int>> dp(n, vector<int>(h + 1, 0));

    for(int i = 0; i < n; i++){
        dp[i][0] = -1;
    }

    dp[k][0] = INF;

    for(int j = 1; j <= h; j++){
        for(int i = 0; i < n; i++){
            dp[i][j] = dp[i][j - 1];
        }

        for(int i = 0; i < m; i++){
            int a = elek[i].a;
            int b = elek[i].b;
            int c = elek[i].c;

            dp[a][j] = max(dp[a][j], min(dp[b][j - 1], c));
            dp[b][j] = max(dp[b][j], min(dp[a][j - 1], c));
        }
    }

    for(int i = 0; i < n; i++){
        cout << (dp[i][h] == INF ? 0 : dp[i][h]) << "\n";
    }
}