#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <climits>
#define ll long long 

using namespace std;

struct element
{
    bool seen = false, ok = false;
    vector <pair<ll, ll> > sz;
};
vector <element> x;
ll n, m, k, i, j, a, b, c, start, h;
vector <vector<ll> > y;

bool compare(pair<ll, ll>& a, pair<ll, ll>& b)
{
    return a.second > b.second;
}

int main()
{
    ios::sync_with_stdio(false);
    cin >> n >> m >> start >> h;
    y.resize(n + 1,vector<ll> (h+1,0));
    x.resize(n + 1);
    for (i = 1; i <= m; ++i)
    {
        cin >> a >> b >> c;
        x[a].sz.push_back({ b,c });
        x[b].sz.push_back({ a,c });
    }
    for (i = 1; i <= n; ++i)
    {
        sort(x[i].sz.begin(), x[i].sz.end(), compare);
        
    }

    deque <pair<ll,ll> > v;
    v.push_back({ start,0 });
    x[start].ok = true;
    y[start][0] = LLONG_MAX;
    pair<ll,ll> curr;
    while (!v.empty())
    {
        curr = v[0];
        x[curr.first].ok = true;
        v.pop_front();
        for (auto& e:x[curr.first].sz)
        {
            if (e.first != start)
            {
                if (curr.second + 1 <= h)
                {
                    if (y[e.first][curr.second + 1] == 0) v.push_back({ e.first,curr.second + 1 });
                    y[e.first][curr.second + 1] = max(y[e.first][curr.second + 1], min(y[curr.first][curr.second], e.second));


                }
            }
        }
    }



    
    for (i = 1; i <= n; ++i)
    {
        if (i == start) cout << "0\n";
        else if (!x[i].ok) cout << "-1\n";
        else
        {
            ll maxi = 0;
            for (j = 1; j <= h; ++j) maxi = max(maxi, y[i][j]);
            if (maxi != 0)cout << maxi << "\n";
            else cout << "-1\n";
        }
    }
}
/*
5 5 1 1
1 2 2
1 5 4
1 4 3
5 4 1
5 3 4


10 9 8 1
1 8 4
3 8 5
6 8 3
8 10 6
7 8 2
8 2 9
8 9 2
5 8 6
4 8 2

*/