// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #include <x86intrin.h>
#include <bits/stdc++.h>
#include <chrono>
#include <random>
// @author: Vlapos
namespace operators
{
template <typename T1, typename T2>
std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x)
{
in >> x.first >> x.second;
return in;
}
template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x)
{
out << x.first << " " << x.second;
return out;
}
template <typename T1>
std::istream &operator>>(std::istream &in, std::vector<T1> &x)
{
for (auto &i : x)
in >> i;
return in;
}
template <typename T1>
std::ostream &operator<<(std::ostream &out, std::vector<T1> &x)
{
for (auto &i : x)
out << i << " ";
return out;
}
template <typename T1>
std::ostream &operator<<(std::ostream &out, std::set<T1> &x)
{
for (auto &i : x)
out << i << " ";
return out;
}
}
// name spaces
using namespace std;
using namespace operators;
// end of name spaces
// defines
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define uint unsigned int
#define all(vc) vc.begin(), vc.end()
// end of defines
// usefull stuff
void boost()
{
ios_base ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
inline int getbit(int &x, int &bt) { return (x >> bt) & 1; }
const int dx4[4] = {-1, 0, 0, 1};
const int dy4[4] = {0, -1, 1, 0};
const int dx8[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
const int dy8[8] = {-1, -0, 1, -1, 1, -1, 0, 1};
const ll INF = (1e18) + 500;
const int BIG = (1e9) * 2 + 100;
const int MAXN = (1e5) + 5;
const int MOD7 = (1e9) + 7;
const int MOD9 = (1e9) + 9;
const uint MODFFT = 998244353;
#define int ll
struct test
{
vector<vector<pii>> graph;
int n, m;
vector<int> countD(int st)
{
vector<int> dist(n, INF);
dist[st] = 0;
priority_queue<pii> q;
q.push({0, 0});
while (q.size())
{
auto [bf, v] = q.top();
q.pop();
if (-bf != dist[v])
continue;
for (auto [tov, c] : graph[v])
if (dist[tov] > dist[v] + c)
{
dist[tov] = dist[v] + c;
q.push({-dist[tov], tov});
}
}
return dist;
}
void solve(int testcase)
{
boost();
cin >> n >> m;
graph.resize(n);
int S, T, V1, V2;
cin >> S >> T >> V1 >> V2;
--S, --T, --V1, --V2;
for (int i = 0; i < m; ++i)
{
int v, tov, c;
cin >> v >> tov >> c;
--v, --tov;
graph[v].pb({tov, c});
graph[tov].pb({v, c});
}
map<int, vector<int>> dist;
dist[S] = countD(S);
dist[T] = countD(S);
dist[V1] = countD(S);
dist[V2] = countD(S);
int mn1 = INF, mn2 = INF;
int D = dist[S][T];
for (int i = 0; i < n; ++i)
if (dist[S][i] + dist[T][i] == D)
{
mn1 = min(mn1, dist[V1][i]);
mn2 = min(mn2, dist[V2][i]);
}
cout << mn1 + mn2 << "\n";
}
};
main()
{
boost();
int q = 1;
// cin >> q;
for (int i = 0; i < q; i++)
{
test t;
t.solve(i);
}
return 0;
}
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//
// //
// Coded by Der_Vlἀpos //
// //
//[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]//
