#include <bits/stdc++.h>
using namespace std;
vector<pair<int,int>> g[100001];
bool seen[100001];
void dfs(int x){
	if (!seen[x]){
		seen[x]=true; 
		for (pair<int, int> edge:g[x]){
			if (!seen[edge.first]) dfs(edge.first);
		}
	}
}
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[x].push_back({y,c});
		g[y].push_back({x,c});
	}
	vector<int> dp;
	dp.assign(n+1,0);
	dfs(k);
	for (auto edge:g[k]){
		dp[edge.first]=edge.second;
	}
	for (int j=1; j<=h;j++){
		for (int i=1; i<=n;i++){
			for (pair<int, int> edge:g[i]){
				dp[edge.first]=max(dp[edge.first], min(dp[i], edge.second));
			}
		}
	}
	for (int i=1; i<=n;i++){
		if (i==k) cout<<0<<endl; 
		else{
			if (!seen[i]) cout<<-1<<endl;
			else cout<<dp[i]<<endl;
		}
	} 
}