/*
author: CRISTIANO RONALDO
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
can do: find_by_order, order_of_key
__builtin_clz(x): the number of zeros at the beginning of the number
__builtin_ctz(x): the number of zeros at the end of the number
__builtin_popcount(x): the number of ones in the number
__builtin_parity(x): the parity (even or odd) of the number of ones
mt19937 rng(16);
mt19937 bruh(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rofl(chrono::steady_clock::now().time_since_epoch().count());
*/
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define lv v+v
#define rv v+v+1
#define files freopen("aa.txt", "r", stdin), freopen("aa.txt", "w", stdout)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair <long long, long long>;
using pii = pair <int,int>;
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
long long mod = 998244353;
const ll N = 1e5 + 10;
const ll M = 2e5 + 10;
const ll P = 311;
const ld EPS = 1e-7;
const ll block = 450;
const ll inf = 2e18;
ll n,m,ans=inf,a[2],b[2],d[N],p[N],tmp1=inf,tmp2=inf;
set <pll> q;
set <ll> s[N];
bool used[N];
vector <pll> g[N];
map <pll, bool> was;
void sub2() {
for(ll i = 1; i<=n; i++) {
d[i] = inf;
}
q.insert({0,a[0]});
d[a[0]] = 0;
p[a[0]] = inf;
while(!q.empty()) {
ll v = (*q.begin()).S; ll ttt = (*q.begin()).F; q.erase(q.begin());
if(ttt > d[v]) {continue;}
for(auto u : g[v]) {
ll bb = u.F; ll w = u.S;
if (d[v]+w < d[bb]) {
d[bb] = d[v]+w;
q.insert({d[bb],bb});
p[bb] = v;
}
}
}
for(ll i = 1; i<=n; i++) {
d[i] = inf;
}
for(ll i = b[0]; i != inf ; i=p[i]) {
was[{min(i,p[i]), max(i,p[i])}] = true;
}
q.insert({0,a[1]});
d[a[1]] = 0;
while(!q.empty()) {
ll v = (*q.begin()).S; ll ttt = (*q.begin()).F; q.erase(q.begin());
if(ttt > d[v]) {continue;}
for(auto u : g[v]) {
ll bb = u.F; ll w = u.S;
if(was[{min(v,bb), max(v,bb)}]) {
w = 0;
}
if (d[v]+w < d[bb]) {
d[bb] = d[v]+w;
q.insert({d[bb],bb});
}
}
}
cout<<d[b[1]];
}
void dfs(ll v) {
for(auto u : s[v]) {
was[{min(u,v), max(u,v)}] = true;
if(!used[u]) {
dfs(u);
}
}
}
void sub1() {
for(ll i = 1; i<=n; i++) {
d[i] = inf;
}
q.insert({0,a[0]});
d[a[0]] = 0;
p[a[0]] = inf;
while(!q.empty()) {
ll v = (*q.begin()).S; ll ttt = (*q.begin()).F; q.erase(q.begin());
if(ttt > d[v]) {continue;}
for(auto u : g[v]) {
ll bb = u.F; ll w = u.S;
if (d[v]+w < d[bb]) {
d[bb] = d[v]+w;
q.insert({d[bb],bb});
s[bb].clear();
s[bb].insert(v);
}
else if(d[v]+w == d[bb]) {
s[bb].insert(v);
}
}
}
for(ll i = 1; i<=n; i++) {
d[i] = inf;
}
dfs(b[0]);
q.insert({0,a[1]});
d[a[1]] = 0;
while(!q.empty()) {
ll v = (*q.begin()).S; ll ttt = (*q.begin()).F; q.erase(q.begin());
if(ttt > d[v]) {continue;}
for(auto u : g[v]) {
ll bb = u.F; ll w = u.S;
if (d[v]+w < d[bb]) {
d[bb] = d[v]+w;
q.insert({d[bb],bb});
}
}
}
cout<<d[b[1]];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin>>n>>m;
cin>>a[0]>>b[0]>>a[1]>>b[1];
for(ll i = 1,xxx,yyy,zzz; i<=m; i++) {
cin>>xxx>>yyy>>zzz;
g[xxx].pb({yyy,zzz});
g[yyy].pb({xxx,zzz});
}
sub1();
return 0;
}
// equal, min, max, 1, random, build
/*
*/
