#include <iostream>
#include <algorithm>

using namespace std;
const int INF = 1 << 29;
int
main()
{
  int n, m, s, g1, g2;
  while (cin >> n >> m >> s >> g1 >> g2) {
    if (n == 0 && m == 0 && s == 0 && g1 == 0 &&g2 == 0) {
      break;
    }
    int G[n][n];

    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        G[i][j] = INF;
      }
      G[i][i] = 0;
    }
    for (int i = 0; i < m; i++) {
      int a, b, c;
      cin >> a >> b >> c;
      G[a - 1][b - 1] = c;
    }

    for (int k = 0; k < n; k++) {
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
          G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
        }
      }
    }
    int ans = INF;
    for (int i = 0; i < n; i++) {
      ans = min(G[s - 1][i] + G[i][g1 - 1] + G[i][g2 - 1], ans);
    }
    cout << ans << endl;
  }
  return 0;
}