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

#ifdef DEBUG
ifstream in_file("minta/be2.txt");
#define input in_file
#define INTHENAMEOFGOD
#else
#define input cin
#define INTHENAMEOFGOD \
    ios::sync_with_stdio(0); \
    cin.tie(0); \
    cout.tie(0);
#endif
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef pair<ll, ll> pii;

ll N, M, H, K, a, b, c;
vector<vector<pii>> G;
vi s;

struct P {
    ll ind, seb, tav;
};

void bfs() {
    queue<P> q;
    q.push((P) {
        .ind = K,
        .seb = LLONG_MAX,
        .tav = 0,
    });
    while (!q.empty()) {
        P c = move(q.front());
        q.pop();
        if (c.tav == H) {
            continue;
        }
        // cout << "asd" << "\n";
        for (pii &next : G[c.ind]) {
            s[next.first] = max(s[next.first], min(c.seb, next.second));
            q.push((P) {
                .ind = next.first,
                .seb = min(c.seb, next.second),
                .tav = c.tav+1
            });
        }
    }
}

int main() {
    INTHENAMEOFGOD
    input >> N >> M >> K >> H;
    K--;
    G.resize(N);
    s.assign(N, -1);
    
    for (ll m = 0; m < M; m++) {
        input >> a >> b >> c;
        a--; b--;
        G[a].emplace_back(b, c);
        G[b].emplace_back(a, c);
    }

    // bfs();
    s[K] = 0;

    for (ll val : s) {
        cout << val << "\n";
    }
}