#include <cstdio>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define N 50010typedef long long ll;
typedef pair<ll,ll> pll;
bool vis[N];
vector<pll>a[N];
stack<int>s;
queue<int>q;
ll val[N];
ll dp[N][2];
ll ans;
int n,m,root;
int p[N][2];void input()
{for(int i=0; i<=n; i++) a[i].clear();for(int i=1; i<=n; i++) scanf("%lld",&val[i]);for(int i=0; i<m; i++){int u,v,w;pll tmp;scanf("%d%d%d",&u,&v,&w);tmp.first=v; tmp.second=w; a[u].push_back(tmp);tmp.first=u; tmp.second=w; a[v].push_back(tmp);}
}void dfs(int rt)
{vis[rt]=true;dp[rt][1]=dp[rt][0]=0; p[rt][1]=p[rt][0]=-1;int size=a[rt].size();for(int i=0; i<size; i++){pll tmp = a[rt][i];int v = tmp.first;int w = tmp.second;if(!vis[v]){dfs(v);if(dp[v][1] + w >= dp[rt][1]){dp[rt][0] = dp[rt][1];p[rt][0] = p[rt][1];dp[rt][1] = dp[v][1]+w;p[rt][1] = v;}else if(dp[v][1] + w > dp[rt][0]){dp[rt][0] = dp[v][1] + w;p[rt][0] = v;}}}dp[rt][1] += val[rt];dp[rt][0] += val[rt];if( dp[rt][1]+dp[rt][0]-val[rt] > ans){root=rt;ans = dp[rt][1]+dp[rt][0]-val[rt];}
}int Path1(int rt)
{int cc=1;int u;while(!s.empty()) s.pop();s.push(rt);for(u=p[rt][1]; u!=-1; u=p[u][1]){s.push(u);cc++;}return cc;
}int Path2(int rt)
{int cc=0;int u;while(!q.empty()) q.pop();for(u=p[rt][0]; u!=-1; u=p[u][1]){q.push(u);cc++;}return cc;
}void solve()
{memset(vis,false,sizeof(vis));memset(p,-1,sizeof(p));ans=-1;   /*初始化为ans=0;root=1; //不要初始化为0*/for(int i=1; i<=n; i++)if(!vis[i])dfs(i);printf("%lld\n",ans);int c1=Path1(root);int c2=Path2(root);printf("%d\n",c1+c2);while(!s.empty()){int t=s.top();s.pop();if(t!=root) printf("%d ",t);else        printf("%d",t);}while(!q.empty()){int t=q.front();q.pop();printf(" %d",t);}printf("\n");
}int main()
{while(scanf("%d%d",&n,&m)!=EOF){input();solve();}return 0;
}