#include <bits/stdc++.h>
using namespace std;

#define int long long

#define INF (int)1e18

template<typename T>
using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N,M,A,B;
	cin>>N>>M>>A>>B;
	vector<vector<tuple<int,int,int>>>g(N+1);
	for(int i=0;i<M;i++){
		int a,b,w;
		cin>>a>>b>>w;
		g[a].emplace_back(b,w,i);
		g[b].emplace_back(a,w,i);
	}
	vector<int>c(N+1,INF);
	min_priority_queue<pair<int,int>>pq;
	c[B]=0;
	pq.emplace(0,B);
	while(!pq.empty()){
		auto[d,i]=pq.top();
		pq.pop();
		if(d>c[i]){
			continue;
		}
		for(auto[j,w,_]:g[i]){
			if(c[i]+w<c[j]){
				c[j]=c[i]+w;
				pq.emplace(c[j],j);
			}
		}
	}
	vector<int>ans,a;
	vector<int>v(M);
	auto bt=[&](auto self,int i)->void{
		a.push_back(i);
		if(i==B){
			vector<int>aa(a);
			sort(aa.begin(),aa.end());
			aa.erase(unique(aa.begin(),aa.end()),aa.end());
			if(aa.size()>ans.size()){
				ans=aa;
			}
		}
		else{
			for(auto[j,_,k]:g[i]){
				if(v[k]>=2){
					continue;
				}
				v[k]++;
				if(c[j]<=c[i]){
					self(self,j);
				}
				v[k]--;
			}
		}
		a.pop_back();
	};
	bt(bt,A);
	cout<<ans.size()<<'\n';
	for(int i:ans){
		cout<<i<<' ';
	}
	cout<<'\n';
	return 0;
}