#include <bits/stdc++.h>
using namespace std;const int N = 505;
const int INF = 0x3f3f3f3f;
#define pb push_back
int n,m,st,ed;
struct Edge{ int to,val; };
vector<Edge>G[N];
int path[N],vis[N],num[N];struct Node{int loc,dist,mxval,cnt;Node(int _loc=0,int _dist=0,int _mxval=0,int _cnt=0):loc(_loc),dist(_dist),mxval(_mxval),cnt(_cnt){}bool operator < (const Node &tmp)const{return dist>tmp.dist;}
}node[N];void Dij(){memset(path,-1,sizeof(path));for(int i=0;i<n;i++){vis[i]=0,node[i]=Node(i,INF,0,0);}priority_queue<Node>q;node[st]=Node(st,0,num[st],1);q.push(node[st]);while(!q.empty()){int u=q.top().loc;q.pop();if(vis[u])continue;vis[u]=1;for(int i=0;i<G[u].size();i++){int v=G[u][i].to,cost=G[u][i].val;if(node[v].dist>node[u].dist+cost){node[v].dist=node[u].dist+cost;path[v]=u;        //记录上一个点node[v].cnt=node[u].cnt;       //更新这个点的最短路条数node[v].mxval=node[u].mxval+num[v];    //记录以这个点为终点的最短路的点权和
                q.push(node[v]);}else if(node[v].dist==node[u].dist+cost){    node[v].cnt+=node[u].cnt;        //因为有多条最短路径，所以这里将之前的最短路径条数加起来 if(node[v].mxval<node[u].mxval+num[v]){       //更新最短路径上的点权最小值 node[v].mxval=node[u].mxval+num[v];path[v]=u;}}}}
}void Print(int u){      //递归打印路径 if(u==st){printf("%d",st);return;}Print(path[u]);printf(" %d",u);
}int main(){scanf("%d%d%d%d",&n,&m,&st,&ed);for(int i=0;i<n;i++)scanf("%d",&num[i]);for(int i=0;i<m;i++){int u,v,w;scanf("%d%d%d",&u,&v,&w);G[u].pb(Edge{v,w});G[v].pb(Edge{u,w});}Dij();printf("%d %d\n",node[ed].cnt,node[ed].mxval);Print(ed);puts("");return 0;
}