#include <bits/stdc++.h>

using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

int n,m,k,h;
vector<vector<pair<int,int>>>g;
vector<int>vis;
vector<int>dist;
vector<int>seb;

int ok(int c,int w)
{
    queue<int>q;
    q.push(k);
    dist[k]=0;
    while(!q.empty())
    {
        int v=q.front();
        q.pop();
        for(auto x:g[v])
        {
            if(x.second>=w && !vis[x.first])
            {
                q.push(x.first);
                dist[x.first]=dist[v]+1;
                vis[x.first]=true;
                seb[x.first]=min(x.second,seb[v]);
            }
        }
    }
    if(vis[c]==0 || dist[c]>h)
    {
        return -1;
    }
    return seb[c];
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>m>>k>>h;
    g.resize(n+1);
    dist.resize(n+1,0);
    vis.resize(n+1,0);
    seb.resize(n+1,INT_MAX);
    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});
    }
    for(int c=1;c<=n;c++)
    {
        vis.assign(n+1,0);
        dist.assign(n+1,-1);
        int l=0,r=10000;
        while(l+1<r)
        {
            int mid=(l+r)/2;
            if(ok(c,mid)!=-1)
            {
                l=mid;
            }else
            {
                r=mid;
            }
        }
        if(c==k)
        {
            cout<<0<<'\n';
        }else if(l==0)
        {
            cout<<-1<<'\n';
        }else
        {
            cout<<ok(c,l)<<'\n';
        }
    }

    return 0;
}