#include<string.h>

 #include<stdlib.h>

 #include<stdio.h>

 #include<vector>

 //#include<assert.h>

 #include<algorithm>

 //#include<iostream>

 using namespace std;

 int n,m,s,t;

 #define maxn 1011

 #define maxm 60011

 struct Edge{int to,v,next;}edge[maxm]; int first[maxn],le=;

 void in(int x,int y,int v) {Edge &e=edge[le]; e.to=y; e.v=v; e.next=first[x]; first[x]=le++;}

 void insert(int x,int y,int v) {in(x,y,v); in(y,x,v);}

 int list[maxn],ll=,ans,numofans,whoisans[];

 bool vis[maxn];

 bool dfs(int x)

 {

     if (x==t) return ;

     vis[x]=;

     for (int i=first[x];i;i=edge[i].next)

     {

         const Edge &e=edge[i]; if (vis[e.to]) continue;

         list[++ll]=i>>;

         if (dfs(e.to)) return ;

         ll--;

     }

     return ;

 }

 int bel[maxn],tot,Time,low[maxn],dfn[maxn],sta[maxn],top;

 struct Tree

 {

     struct Edge{int to,v,id,next;}edge[maxm]; int first[maxn],le;

     void in(int x,int y,int v,int id) {Edge &e=edge[le];e.to=y;e.v=v;e.id=id;e.next=first[x];first[x]=le++;}

     void insert(int x,int y,int v,int id) {in(x,y,v,id); in(y,x,v,id);}

     bool vis[maxn],ok; int select,selectv;

     void clear()

     {

         memset(vis,,sizeof(vis)); ok=;

         memset(first,,sizeof(first)); le=;

     }

     void dfs(int x,int fa,int Min,int Minid)

     {

         if (ok) return;

         if (x==bel[t])

         {

             ok=;

             if (selectv+Min<ans)

             {

                 ans=selectv+Min;

                 numofans=;

                 whoisans[]=select; whoisans[]=Minid;

             }

             return;

         }

         vis[x]=;

         for (int i=first[x];i && !ok;i=edge[i].next)

         {

             const Edge &e=edge[i]; if (vis[e.to]) continue;

             dfs(e.to,x,min(Min,e.v),e.v<Min?e.id:Minid);

         }

     }

 }T;

 void tarjan(int x,int f,int who)

 {

     low[x]=dfn[x]=++Time; sta[++top]=x; vis[x]=;

     for (int i=first[x];i;i=edge[i].next)

     {

         if (i==f || i==(f^) || i==(who<<) || i==((who<<)^)) continue;

         const Edge &e=edge[i];

         if (!dfn[e.to]) tarjan(e.to,i,who),low[x]=min(low[x],low[e.to]);

         else if (vis[e.to]) low[x]=min(low[x],dfn[e.to]);

     }

     if (low[x]==dfn[x])

     {

         tot++;

         while (sta[top]!=x) bel[sta[top]]=tot,vis[sta[top--]]=;

         bel[sta[top--]]=tot,vis[x]=;

     }

 }

 void tarjan(int select)

 {

     top=tot=Time=;

     memset(dfn,,sizeof(dfn));

     memset(vis,,sizeof(vis));

     for (int i=;i<=n;i++) if (!dfn[i]) tarjan(i,,select);

     if (bel[s]==bel[t]) return;

     T.clear();

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

         for (int j=first[i];j;j=edge[j].next) if ((j>>)!=select)

         {

             const Edge &e=edge[j];

             if (bel[i]!=bel[e.to]) T.in(bel[i],bel[e.to],e.v,j>>);

         }

     T.select=select; T.selectv=edge[select<<].v;

     T.dfs(bel[s],,0x7fffffff,);

     if (!T.ok) {if (edge[select<<].v<ans) {ans=edge[select<<].v; numofans=; whoisans[]=select;}}

 }

 int main()

 {

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

     for (int i=,x,y,v;i<=m;i++) scanf("%d%d%d",&x,&y,&v),insert(x,y,v);

     dfs(s);

     if (ll==) {puts("0\n0"); return ;}

     numofans=-; ans=0x7fffffff;

     for (int i=;i<=ll;i++) tarjan(list[i]);

     if (numofans==-) puts("-1");

     else

     {

         printf("%d\n%d\n",ans,numofans);

         for (int i=;i<=numofans;i++) printf("%d ",whoisans[i]);

     }

     return ;

 }