#include <iostream>

 #include<cstring>

 #include<algorithm>

 #include<stdlib.h>

 #include<vector>

 #include<cstdio>

 #include<queue>

 using namespace std;

 #define N 2000010

 #define INF 0xfffffff

 struct node

 {

     int u,v,next;

     double w;

 }ed[N<<];

 int t,head[N],vis[N],dis[N],pa[N],o[N];

 double p[N];

 int n,m;

 void init()

 {

     t = ;

     memset(head,-,sizeof(head));

 }

 void add(int u,int v,int w)

 {

     ed[t].u = u;

     ed[t].v = v;

     ed[t].w = w;

     ed[t].next = head[u];

     head[u] = t++;

 }

 void spfa(int s,int e)

 {

     memset(vis,,sizeof(vis));

     int i;

     for(i = ; i <= n ; i++)

     {

         dis[i] = INF;

         p[i] = ;

     }

     queue<int>q;

     dis[s] = ;

     p[s] = ;

     q.push(s);

     while(!q.empty())

     {

         int u = q.front();

         q.pop();

         vis[u] = ;

         for(i = head[u] ; i != - ; i = ed[i].next)

         {

             int v = ed[i].v;

             double w = ed[i].w;

             if(dis[v]>=dis[u]+)

             {

                 if(dis[v]==dis[u]+)

                 {

                     if(p[v]<p[u]*w/100.0)

                     {

                         p[v] = p[u]*w/100.0;

                         pa[v] = u;

                     }

                 }

                 else

                 {

                     dis[v] = dis[u]+;

                     p[v] = p[u]*w/100.0;

                     pa[v] = u;

                 }

                 if(!vis[v])

                 {

                     vis[v] = ;

                     q.push(v);

                 }

             }

         }

     }

     printf("%d %lf\n",dis[e],-p[e]);

     int x = pa[e],g=;

     o[g] = e;

     while(x!=s)

     {

         g++;

         o[g] = x;

         x = pa[x];

     }

     g++;

     o[g] = s;

     for(i = g ; i > ; i--)

     printf("%d ",o[i]);

     printf("%d\n",o[]);

 }

 int main()

 {

     int i;init();

     int a,b;

     scanf("%d%d",&n,&m);

     scanf("%d%d",&a,&b);

     for(i = ; i <= m ; i++)

     {

         int u,v;

         double w;

         scanf("%d%d%lf",&u,&v,&w);

         add(u,v,-w);

         add(v,u,-w);

     }

     spfa(a,b);

     return ;

 }