#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long ll;
#define N 102
int n,m,s,g1,g2;

ll g[N][N];

int main()
{
  while(scanf("%d%d%d%d%d",&n,&m,&s,&g1,&g2),n|m|s|g1|g2) {
    --s,--g1,--g2;
    memset(g,-1,sizeof(g));
    for (int i=0;i<m;++i) {
      int f,t,c;scanf("%d%d%d",&f,&t,&c);
      --f,--t;
      g[f][t]=c;
    }

    for (int i=0;i<n;++i) g[i][i]=0;

    for (int i=0;i<n;++i)
      for (int j=0;j<n;++j)
	if (g[j][i]!=-1)
	  for (int k=0;k<n;++k)
	    if (g[i][k]!=-1) 
	      if (g[j][k]==-1||g[j][k]>g[j][i]+g[i][k])
		g[j][k]=g[j][i]+g[i][k];
    /*
    for (int i=0;i<n;++i) {
      for (int j=0;j<n;++j)
	printf("%d ",g[j][i]);
      puts("");
    }
    */

    ll ans=INT_MAX;
    for (int i=0;i<n;++i) {
      if (g[s][i]==-1) continue;
      if (g[i][g1]==-1) continue;
      if (g[i][g2]==-1) continue;
      ans=min(ans,g[s][i]+g[i][g1]+g[i][g2]);
    }
    printf("%Ld\n",ans);
  }
}