#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> p32;
typedef pair<ll, ll> p64;
typedef pair<double, double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int>> vv32;
typedef vector<vector<ll>> vv64;
typedef vector<vector<p64>> vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i, e) for (ll i = 0; i < e; i++)
#define forsn(i, s, e) for (ll i = s; i < e; i++)
#define rforn(i, s) for (ll i = s; i >= 0; i--)
#define rforsn(i, s, e) for (ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout << #x << " = " << x << ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin()                    \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())

int main()
{
    fast_cin();
    //ifstream cin("in.txt");

    int n;
    cin >> n;
    int m;
    cin >> m;
    int k;
    cin >> k;
    int h;
    cin >> h;

    vector<vector<pair<int, int>>> aL(n + 1);

    for (int i = 1; i <= m; i++)
    {
        int a;
        cin >> a;
        int b;
        cin >> b;
        int c;
        cin >> c;

        aL[a].push_back({b, c});
        aL[b].push_back({a, c});
    }

    priority_queue<pair<int, pair<int, int>>> pq;

    vector<vector<int>> ans(n + 1, vector<int>(h + 1));
    for (int i = 0; i < aL[k].size(); i++)
    {
        pq.push({aL[k][i].second, {k, aL[k][i].first}});
    }
    vector<bool> check(n + 1);
    check[k] = 1;

    while (!pq.empty())
    {

        int a = pq.top().second.first;
        int b = pq.top().second.second;
        int c = pq.top().first;

        // cout << a << " " << b << " " << c << '\n';
        pq.pop();
        check[b] = 1;

        if (a == k)
        {
            ans[b][1] = c;
        }
        else
        {
            for (int i = 1; i <= h; i++)
            {
                ans[b][i] = max(ans[b][i], min(ans[a][i - 1], c));
            }
        }

        /*for (int j = 0; j <= h; j++)
        {
            cout << ans[b][j] << " ";
        }
        cout << '\n';
        cout << '\n';*/

        for (int i = 0; i < aL[b].size(); i++)
        {
            if (!check[aL[b][i].first])
            {
                pq.push({aL[b][i].second, {b, aL[b][i].first}});
            }
        }
    }

    for (int i = 1; i <= n; i++)
    {
        int anss = -1;
        for (int j = 0; j <= h; j++)
        {
            anss = max(anss, ans[i][j]);
        }
        cout << anss << '\n';
    }

    return 0;
}