#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef vector<int> array;
typedef vector<array> matrix;
const int infty=1<<28;
int main(void)
{
    int vertices,edges,src,dst1,dst2;
    while ( cin>>vertices>>edges>>src>>dst1>>dst2 &&
            vertices>0 ) {
        --src;--dst1;--dst2;
        matrix cost(vertices,array(vertices,infty));
        for ( int i=0 ; i<vertices ; i++ )
            cost[i][i]=0;
        for ( int i=0 ; i<edges ; i++ ) {
            int from,to,c;
            cin>>from>>to>>c;
            --from;--to;
            cost[from][to]=min(cost[from][to],c);
        }
        for ( int k=0 ; k<vertices ; k++ )
            for ( int i=0 ; i<vertices ; i++ )
                for ( int j=0 ; j<vertices ; j++ )
                    cost[i][j]=min(cost[i][j],
                                   cost[i][k]+cost[k][j]);
        int record=infty;
        for ( int branch=0 ; branch<vertices ; branch++ )
            record=min(record,
                       cost[src][branch]+cost[branch][dst1]+cost[branch][dst2]);
        cout<<record<<endl;
    }
    return 0;
}