#include <bits/stdc++.h>
using namespace std;
vector<pair<pair<int, int>,int>> g;
bool seen[100001];

int main() {
	int n,m,k,h;
	cin>>n>>m>>k>>h;
	for (int i=0; i<m;i++){
		int x,y,c;
		cin>>x>>y>>c; 
		g.push_back({{x,y},c});
	}
	vector<vector<int>> dp;
	dp.resize(n+1,vector<int>(h+1,0));
	dp[k][0]=1e9;
	for (int j=1; j<=h;j++){
		for (int i=1; i<=n;i++) dp[i][j]=dp[i][j-1];
			for (pair<pair<int,int>, int> edge:g){
				dp[edge.first.first][j]=max(dp[edge.first.first][j],min(dp[edge.first.second][j-1],edge.second));
				dp[edge.first.second][j]=max(dp[edge.first.second][j],min(dp[edge.first.first][j-1],edge.second));
		}
	}
	for (int i=1; i<=n;i++){
		if (i==k) cout<<0<<endl; 
		else{
		 if (dp[i][h]==0) cout<<-1<<endl;
		 else cout<<dp[i][h]<<endl;
		}
	} 
}