#include <bits/stdc++.h>
#include <queue>
using namespace std;

int main() {
	int n, m, k, h;
	cin >> n >> m >> k >> h;
	vector<vector<pair<int, int> > > elek(n+1, vector<pair<int, int> >());
	for (int i=0; i<m; i++)  {
		int x, y, z;
		cin >> x >> y >> z;
		elek[x].push_back({y, z});
		elek[y].push_back({x, z});
	}

	vector<vector<int> > tav(n+1, vector<int>(h+1, -10e5-1));
	tav[k][0]=10e5+1;
	priority_queue<pair<int, pair<int, int> > > sor; //hany, honnan, hova
	vector<bool> volt(n+1, false);
	volt[k]=true;
	sor.push({0, {k, k}});
	while (sor.size()>0) {
		int messze=sor.top().first;
		int honnan=sor.top().second.first;
		int hova=sor.top().second.second;
		sor.pop();
		volt[hova]=true;
		//cout << hova << ": ";
		for (int i=1; i<h+1; i++) {
			tav[hova][i]=max(tav[hova][i], min(messze, tav[honnan][i-1]));
			//cout << tav[hova][i] << " ";
		}
		//cout << "\n";
		for (pair<int, int> sz : elek[hova]) {
			if (volt[sz.first]==false) {
				sor.push({sz.second, {hova, sz.first}});
			}

		}
	}

	for (int i=1; i<n+1; i++) {
		int epp=-10e5+1;
		for (int j=0; j<h+1; j++) {
			//cout << tav[i][j]<< " ";
			epp=max(epp, tav[i][j]);
		}
		//cout << epp << "\n";
		if (epp==10e5+1) {
			cout << "0\n";
		}
		else {
			cout << epp << "\n";
		}
	}
}