QBBUILD

//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 105
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

struct dat
{
    int u, v, w;
};

int n, m;
int a[N][N];
int node[5];
int d[N][N];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n;
    for(int i=1; i<=4; i++) cin >> node[i];
    int u,v,z;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++) d[i][j] = inf;
    for(int i=1; i<=n; i++) d[i][i] = 0;
    while (cin >> u >> v >> z)
    {
        d[u][v] = d[v][u] = z;
    }
}

void floyd()
{
    for(int k=1; k<=n; k++)
    {
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
            {
                if (d[i][j] > d[i][k] + d[k][j])
                    d[i][j] = d[i][k] + d[k][j];
            }
        }
    }
}

void proc()
{
    floyd();
    sort(node+1,node+5);
    int pre[25][5];
    pre[1][1] = node[1];
    pre[1][2] = node[2];
    pre[1][3] = node[3];
    pre[1][4] = node[4];
    int cur = 1;
    while (next_permutation(node+1,node+5))
    {
        cur++;
        for(int i=1; i<=4; i++) pre[cur][i] = node[i];
    }
    int res = inf;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            for(int k=1; k<=24; k++)
            {
                int x = d[i][j];
                x += d[i][pre[k][1]];
                x += d[i][pre[k][2]];
                x += d[j][pre[k][3]];
                x += d[j][pre[k][4]];
                res = min(res,x);
            }
        }
    }
    cout << res;
}

signed main()
{
    readfile();
    proc();
    return 0;
}