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

int main() {
	int n,m,k,h;
	cin >> n >> m >> k >> h;
	for (int i=0;i<m;i++){
		int u,v,b;
		cin >> u >> v >> b;
		g.push_back({u,v,b});
	}
	vector<vector<int>> dp(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 (array<int, 3> edge:g){
            dp[edge[0]][j]=max(dp[edge[0]][j],min(dp[edge[1]][j-1],edge[2]));
            dp[edge[1]][j]=max(dp[edge[1]][j],min(dp[edge[0]][j-1],edge[2]));
		}
	}
	for (int i=1;i<=n;i++){
		if (i==k) cout<< 0 <<"\n";
		else{
		 if (dp[i][h]==0) cout<< -1 << "\n";
		 else cout << dp[i][h] << "\n";
		}
	}
}