#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
class CA
{
public:
enum{N=501,INF=0x7FFFFFFF/2};
void run();
void dijkstra();
void getbestpath(int v);
int n,m,s,d,ar[N][N],cost[N][N],mincost,minpath;
vector<int> allpath[N],possiblepath,bestpath;
};
void CA::getbestpath(int v)
{
possiblepath.push_back(v);
if(v==s)
{
int curcost,i=1;
curcost=cost[possiblepath[i-1]][possiblepath[i]];
for(i++;i<possiblepath.size();i++)
{
curcost+=cost[possiblepath[i-1]][possiblepath[i]];
}
if(curcost<mincost)
{
mincost=curcost;
bestpath=possiblepath;
}
}
int i;
for(i=0;i<allpath[v].size();i++)
{
getbestpath(allpath[v][i]);
possiblepath.pop_back();
}
}
void CA::dijkstra()
{
bool visit[N];
int dist[N],k,i;
fill_n(visit,n,false);
copy(ar[s],ar[s]+n,dist);
dist[s]=0;
while(1)
{
k=-1;
for(i=0;i<n;i++)
{
if(visit[i]) continue;
if(k==-1||dist[i]<dist[k]) k=i;
}
if(k==-1) break;
visit[k]=true;
for(i=0;i<n;i++)
{
if(visit[i]) continue;
if(dist[i]>dist[k]+ar[k][i])
{
dist[i]=dist[k]+ar[k][i];
allpath[i].clear();
allpath[i].push_back(k);
}
else if(dist[i]==dist[k]+ar[k][i])
{
allpath[i].push_back(k);
}
}
}
minpath=dist[d];
}
void CA::run()
{
mincost=INF;
scanf("%d%d%d%d",&n,&m,&s,&d);
int i;
for(i=0;i<n;i++) fill_n(ar[i],n,INF);
for(i=0;i<n;i++) fill_n(cost[i],n,INF);
for(i=0;i<m;i++)
{
int r1,r2,di,co;
scanf("%d%d%d%d",&r1,&r2,&di,&co);
ar[r1][r2]=di;ar[r2][r1]=di;
cost[r1][r2]=co;cost[r2][r1]=co;
}
dijkstra();
getbestpath(d);
for(i=bestpath.size()-1;i>=0;i--) printf("%d ",bestpath[i]);
printf("%d %d",minpath,mincost);
}
int main()
{
// freopen("test.in","r",stdin);
CA *a=new CA;
a->run();
return 0;
}