#include"bits/stdc++.h"

//#include<bits/stdc++.h>
using namespace std;
#define print(x) cout<<x<<endl;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a) for(int i=0;i<a;i++)
typedef long long ll;
typedef pair<int, int> PI;
typedef pair<int, PI> V;
const ll mod = 100000000;

int n, m, s, g;
int a[20000], b[20000], c[20000];
int d[202];
bool used[202];
int cost[202][202];

void dijkstra(int s) {
	REP(i, n)d[i] = mod;
	REP(i, n)used[i] = 0;
	d[s] = 0;

	while (true) {
		int v = -1;
		REP(u, n) {
			if (!used[u] && (v == -1 || d[u] < d[v]))v = u;
		}
		if (v == -1)break;
		used[v] = true;
		REP(u, n) {
			d[u] = min(d[u], d[v] + cost[v][u]);
		}
	}
}

int main() {
	cin >> n >> m >> s >> g;
	REP(i, 202)REP(j, 202)cost[i][j] = mod;
	REP(i, m) {
		cin >> a[i] >> b[i] >> c[i];
		cost[a[i]][b[i]] = c[i];
		cost[b[i]][a[i]] = c[i];
	}
	dijkstra(s);
	vector<int> v;
	v.push_back(g);
	int now = g;
	
	while (now != s) {
		int next = mod;
		rep(i, 0, n) {
			if (d[i] == d[now] - cost[i][now]) {
				next= min(next, i);
			}
		}
		now = next;
		v.push_back(now);
	}
	reverse(v.begin(), v.end());
	//print(d[g]);
	REP(i,v.size())cout<<v[i] << " ";
	cout << endl;
	return 0;
}