/*
Author: baodat
※\(^o^)/※
Current goal: Training for VNOI shirt
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, l, r) for(int i = l; i <= r; i++)
#define FORD(i, l, r) for(int i = l; i >= r; i--)
#define db double
#define ldb long double
#define all_1(x) (x).begin() + 1, (x).end()
#define all(x) (x).begin(), (x).end()
#define ins insert
#define pb push_back
template<typename T>void debug_var(const T& var, const string& name){
cerr << name << ": " << var << "\n";
}
template<typename T>void debug_1d(const T& vt, const string& name){
if(vt.empty()){
cerr << name << " is empty!\n";
return;
}
FOR(i, 0, (int)vt.size() - 1){
cerr << name << "[" << i << "]: " << vt[i] << "\n";
}
}
const ll oo = 2e18;
const int N = 1e5 + 5;
int n, m, S, T, U, V;
struct Data{
int v, w;
};
vector<Data> adj[N];
vector<ll> dijkstra(int start){
vector<ll> dist(n + 1, oo);
dist[start] = 0;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
pq.push({0, start});
while(!pq.empty()){
auto [dist_u, u] = pq.top();
pq.pop();
if(dist_u != dist[u]) continue;
for(auto[v, w] : adj[u]){
if(dist[v] > dist[u] + w){
dist[v] = dist[u] + w;
pq.push({dist[v], v});
}
}
}
return dist;
}
void solve(){
cin >> n >> m >> S >> T >> U >> V;
FOR(i, 1, m){
int u, v, w;
cin >> u >> v >> w;
adj[u].pb({v, w});
adj[v].pb({u, w});
}
vector<ll> dist_S = dijkstra(S);
vector<ll> dist_T = dijkstra(T);
vector<ll> dist_U = dijkstra(U);
vector<ll> dist_V = dijkstra(V);
vector<int> order(n + 1);
iota(all(order), 0);
sort(all_1(order), [&](int i, int j){
return dist_S[i] < dist_S[j];
});
vector<ll> dp_u = dist_U, dp_v = dist_V;
ll ans = oo;
FOR(i, 1, n){
int u = order[i];
if(dist_S[u] + dist_T[u] == dist_S[T]){
ans = min(ans, min(dp_u[u] + dist_V[u], dp_v[u] + dist_U[u]));
}
for(auto[v, w] : adj[u]){
if(w + dist_S[u] + dist_T[v] == dist_S[T]){
dp_u[v] = min(dp_u[v], dp_u[u]);
dp_v[v] = min(dp_v[v], dp_v[u]);
}
}
}
cout << ans << "\n";
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--){
solve();
}
return 0;
}
