#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

typedef struct{
	int to;
	int cost;
}edge;

class my_distance{
public:
	long long cost;
	vector<int> s;
	my_distance(){
		
	}
	my_distance(long long cost_, const vector<int> s_){
		cost = cost_;
		s = s_;
	}
	my_distance(const my_distance& x){
		this->cost = x.cost;
		this->s = x.s;
	}


	bool operator<(const my_distance& x) const{
		if(this->cost != x.cost) return this->cost < x.cost;
		return this->s < x.s;
	}
	bool operator>(const my_distance& x) const{
		if(this->cost != x.cost) return this->cost > x.cost;
		return this->s > x.s;
	}
};

//distance from s
//O(E log V)
void dijkstra(vector< vector<edge> > &G, vector< my_distance > &dist, int s){

	//INF as distance
	const long long INF = 1LL<<60LL;
	
	//first : distance from s, second : its vertex
	priority_queue< pair<my_distance, int> , vector< pair<my_distance, int>  >, greater< pair<my_distance, int> >> pq;
	 
	fill(dist.begin(), dist.end(),  my_distance(INF, {}) );
	dist[s] = my_distance(0, {s});

	pq.push( {dist[s], s} );

	while(!pq.empty()){
		auto q = pq.top();
		pq.pop();

		int from = q.second;
		if(dist[from] < q.first) continue; // it's not minimum distance

		int n=G[from].size();
		for(int i=0; i<n; i++){
			edge e = G[from][i];
			my_distance next = dist[from];
			next.cost += e.cost;
			next.s.push_back(e.to);

			if(dist[e.to] > next){
				dist[e.to] = next;
				pq.push( {dist[e.to], e.to} );
			}
		}
	}
}
 
void add_edge(vector<vector<edge> > &G, int from, int to, int cost){
	G[from].push_back( (edge){to, cost} );
	G[to].push_back( (edge){from, cost} );
}
 
int main(){
	int N,M,S,G;
	cin >> N >> M >> S >> G;

	vector<vector<edge>> Graph(N);
	for(int i=0; i<M; i++){
		int a,b,c;
		cin >> a >> b >> c;

		add_edge(Graph, a, b, c);
	}

	vector<my_distance> dist(N);
	dijkstra(Graph, dist, S);
	auto ans = dist[G].s;
	for(int i=0; i<ans.size(); i++){
		cout << ans[i] << " ";
	}
	cout << endl;

	return 0;
}