#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
#include <numeric>
#include <string>

#define N_MAX 200
#define M_MAX (N_MAX * (N_MAX-1) / 2)
#define C_MAX 10000
#define INF (N_MAX * C_MAX)

using namespace std;

int main(void)
{
    int N, M, S, G, cost[N_MAX][N_MAX], d[N_MAX][N_MAX];
    cin >> N >> M >> S >> G;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            if (i == j) {
                cost[i][j] = d[i][j] = 0;
            } else {
                cost[i][j] = d[i][j] = INF;
            }
        }
    }
    for (int i = 0; i < M; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        cost[a][b] = d[a][b] = c;
        cost[b][a] = d[b][a] = c;
    }
    for (int k = 0; k < N; k++) {
        for (int i = 0; i < N; i++) {
            for (int j = 0; j < N; j++) {
                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
            }
        }
    }
    int x = S;
    int l = d[S][G];
    while (x != G) {
        printf("%d ", x);
        for (int i = 0; i < N; i++) {
            if (i != x && cost[x][i] + d[i][G] == l) {
                x = i;
                l = d[i][G];
                break;
            }
        }
    }
    printf("%d\n", G);
    return 0;
}