#include <iostream>
#include <vector>
#include <queue>
using namespace std;

struct node{
    int maxi=-1;
    int speed[101] = {-1};
    vector<pair<int, int>> szomszed;
};

node a[10000];
int n, k, h;
void bejar(int x, int tav){
    a[x].maxi=max(a[x].maxi, a[x].speed[tav]);
    if(tav==h){
        return;
    }
    //cout << "\n\nx: " << x << "\ntav: " << tav;
    for(pair<int, int> i: a[x].szomszed){
        if(x==3&&i.first==2){
            //cout << "\n\na[x].speed[tav]: " << a[x].speed[tav];
            //cout << "a[i.first].speed[tav+1]): " << a[i.first].speed[tav+1];
        }
        if(min(a[x].speed[tav], i.second)>a[i.first].speed[tav+1]){
            a[i.first].speed[tav+1]=min(a[x].speed[tav], i.second);
            bejar(i.first, tav+1);
        }
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int k, b, c, y, m, x, tav;
    cin >> n >> m >> k >> h;
    k--;
    while(m--){
        cin >> b >> c >> y;
        b--;
        c--;
        a[c].szomszed.push_back(make_pair(b, y));
        a[b].szomszed.push_back(make_pair(c, y));
    }
    a[k].speed[0]=9999999;
    bejar(k, 0);
    queue<pair<int, int>> q;
    q.push(make_pair(k, 0));
    while(!q.empty()){
        x=q.front().first;
        tav=q.front().second;
        q.pop();
        a[x].maxi=max(a[x].maxi, a[x].speed[tav]);
        if(tav!=h){
            for(pair<int, int> i: a[x].szomszed){
                if(min(a[x].speed[tav], i.second)>a[i.first].speed[tav+1]){
                    a[i.first].speed[tav+1]=min(a[x].speed[tav], i.second);
                    q.push(make_pair(i.first, tav));
                }
            }
        }

    }





    a[k].maxi=0;
    for(int i=0; i<n; i++){
        cout << a[i].maxi << '\n';
    }
    return 0;
}