#include <bits/stdc++.h>

using namespace std;

int n,m,k,h;
vector<vector<pair<int,int>>>g;
vector<int>velocity;
vector<bool>rewrote;
vector<int>velocity2;

void bellmann_ford()
{
    for(int i=1;i<=h;i++)
    {
        //rewrote.assign(n+1,0);
        for(int j=1;j<=n;j++)
        {
            for(auto x:g[j])
            {
                if(velocity[x.first]<min(velocity2[j],x.second)&& !rewrote[j])
                {
                    velocity[x.first]=min(velocity2[j],x.second);
                    //rewrote[x.first]=true;
                }
            }
        }
        velocity2=velocity;
    }
}

int main()
{
    cin>>n>>m>>k>>h;
    velocity.resize(n+1,-1);
    velocity2.resize(n+1,-1);
    g.resize(n+1);
    rewrote.resize(n+1,0);
    for(int i=1;i<=m;i++)
    {
        int u,v,w;
        cin>>u>>v>>w;
        g[u].push_back({v,w});
        g[v].push_back({u,w});
    }
    velocity[k]=INT_MAX;
    velocity2[k]=INT_MAX;
    bellmann_ford();
    for(int i=1;i<=n;i++)
    {
        if(i==k)
        {
            cout<<0<<'\n';
        }else
        {
            cout<<velocity[i]<<'\n';
        }
    }
    return 0;
}

/*4 6 2 2
1 2 1
2 3 1
2 4 1
1 3 1
1 4 5
3 4 5

4 5 1 2
1 3 1
1 2 1
2 3 3
3 4 3
1 4 3

6 8 1 3
1 3 1
1 2 1
2 3 3
3 4 3
1 4 3
1 5 5
5 6 5
2 6 5

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

3 2 1 1
1 2 4
2 3 4

4 5 1 2
1 2 3
1 3 2
1 4 1
2 3 3
3 4 2
*/