#include <bits/stdc++.h>

#define REP(i, x, n) for(int i = x; i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define F first
#define S second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;

const int INF = 1 << 29;

int N, M, S, G;
int edge[200][200];
int minCost[200][200];

int main() {
  cin >> N >> M >> S >> G;

  rep(i, N) rep(j, N) {
    edge[i][j] = INF;
    minCost[i][j] = (i == j ? 0 : INF);
  }
  
  rep(i, M) {
    int a, b, c;
    cin >> a >> b >> c;
    edge[a][b] = edge[b][a] = c;
    minCost[a][b] = minCost[b][a] = c;
  }

  rep(k, N) rep(i, N) rep(j, N) {
    minCost[i][j] = min(minCost[i][j], minCost[i][k] + minCost[k][j]);
  }

  vector<int> ans;
  ans.push_back(S);

  while(S != G) {
    rep(i, N) if(S != i && edge[S][i] + minCost[i][G] == minCost[S][G]) {
      ans.push_back(i);
      S = i;
      break;
    }
  }

  rep(i, ans.size()) {
    if(i) cout << ' ';
    cout << ans[i];
  }
  cout << endl;

  return 0;
}