AOJ2005.cpp

#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };


int main() {
	int n, m, s, g1, g2;
	while (cin >> n >> m >> s >> g1 >> g2, n){
		vector<vector<int>> load(n + 1, vector<int>(n + 1, 100000000));//from back to 
		REP(i, m){
			int b1, b2, c;
			cin >> b1 >> b2 >> c;
			load[b1][b2] = c;
		}

		FOR(i, 1, n + 1)load[i][i] = 0;

		FOR(i, 1, n + 1){
			FOR(j, 1, n + 1){
				FOR(k, 1, n + 1){
					load[j][k] = min(load[j][k], load[j][i] + load[i][k]);
				}
			}
		}
		int ans = 100000000;
		FOR(i, 1, n + 1){
			ans = min(ans,load[s][i]+load[i][g1]+load[i][g2]);
		}
		cout << ans << endl;
	}
}