/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm;
typedef tuple < ll, ll, ll > tp;
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
//const ll mod = (ll) 998244353;
const ll mod = (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
bool USACO = 0;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll N = 1e5 + 5;
ll dis[4][N];
ll mn[2][N];
ll n;
vector < ii > g[N];
void make(ll start, ll id){
for(ll i = 1; i <= n; i++){
if(id < 2) mn[id][i] = INF;
dis[id][i] = INF;
}
vector < bool > vis(n + 1, 0);
priority_queue < ii , vector < ii > , greater < ii > > p;
dis[id][start] = 0;
p.push({0, start});
while(p.size()){
auto [d , node] = p.top(); p.pop();
if(vis[node]) continue;
vis[node] = 1;
if(id < 2) mn[id][node] = min(mn[id][node], dis[3][node]);
for(auto [u , w] : g[node]){
if(dis[id][u] > dis[id][node] + w){
dis[id][u] = dis[id][node] + w;
if(id < 2) mn[id][u] = mn[id][node];
p.push({dis[id][u], u});
}else if(dis[id][u] == dis[id][node] + w){
if(id < 2) mn[id][u] = min(mn[id][node], mn[id][u]);
}
}
}
return;
}
void solve(){
ll m;
cin >> n >> m;
ll s , t , u , v; cin >> s >> t >> u >> v;
for(ll i = 1; i <= m; i++){
ll x, y , w;
cin >> x >> y >> w;
g[x].pb({y, w});
g[y].pb({x, w});
}
make(v, 3);
make(u, 2);
make(t, 1);
make(s, 0);
ll ans = dis[2][v];
for(ll i = 1; i <= n; i++){
if(dis[0][i] + dis[1][i] == dis[0][t]){
ans = min({ans, dis[2][i] + mn[1][i] , mn[0][i] + dis[2][i]});
}
}
cout << ans << '\n';
return;
}
int main() {
#ifdef LOCAL
freopen("in", "r", stdin);
freopen("out", "w", stdout);
auto start_time = clock();
#else
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#endif
//pre(N);
ll T = 1, CT = 0; //cin >> T;
while(T--){
solve();
}
#ifdef LOCAL
auto end_time = clock();
cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
#endif
return 0;
}
