#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
using namespace std;
struct edge{int to,cost;};
struct data{
    int pos,cost;
    bool operator>(const data &d)const{
        return cost>d.cost;
    }
};
const int INF=1e9+7;
int n,m,s,g;
vector<edge>G[200];
int d[200];
set<vector<int> >S;
void dfs(int pos,int cost,vector<int>way){
    way.push_back(pos);
    if(pos==s){
        reverse(way.begin(),way.end());
        S.insert(way);
        return;
    }
    for(int i=0;i<G[pos].size();i++){
        edge &e=G[pos][i];
        if(d[e.to]==cost-e.cost){
            dfs(e.to,cost-e.cost,way);
        }
    }
}
int main(){
    scanf("%d%d%d%d",&n,&m,&s,&g);
    for(int i=0;i<m;i++){
        int a,b,c;
        scanf("%d%d%d",&a,&b,&c);
        G[a].push_back((edge){b,c});
        G[b].push_back((edge){a,c});
    }
    fill_n(d,n,INF);
    priority_queue<data,vector<data>,greater<data> >Q;
    Q.push((data){s,0});
    while(Q.size()){
        int pos=Q.top().pos,cost=Q.top().cost;
        Q.pop();
        if(d[pos]<cost)continue;
        d[pos]=cost;
        for(int i=0;i<G[pos].size();i++){
            edge &e=G[pos][i];
            Q.push((data){e.to,cost+e.cost});
        }
    }
    dfs(g,d[g],vector<int>(0));
    vector<int>ans=*(S.begin());
    for(int i=0;i<ans.size();i++){
        if(i)printf(" ");
        printf("%d",ans[i]);
    }
    puts("");
    return 0;
}