#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define fi first
#define se second
template<class T> bool ckmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<class T> bool ckmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}
namespace debug {
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for(auto z : x) cerr << (f++ ? "," : ""), __print(z); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if(sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef ljuba
#define dbg(x...) cerr << "\e[91m" << "LINE(" << __LINE__ << ") -> " << "[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif
}
using namespace debug;
const char nl = '\n';
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const int mxN = 1e5 + 12;
vpii adj[mxN];
const ll INF = 1e18 + 12;
vll dijkstra(int n, int s) {
vll dist(n, INF);
priority_queue<pll, vpll, greater<>> pq;
dist[s] = 0;
pq.push({dist[s], s});
while(!pq.empty()) {
auto tren = pq.top();
pq.pop();
if(dist[tren.se] != tren.fi) continue;
for(auto e : adj[tren.se]) {
if(ckmin(dist[e.fi], dist[tren.se] + e.se)) {
pq.push({dist[e.fi], e.fi});
}
}
}
dbg(dist);
return dist;
}
ll resi(int n, int s, int t, const vll &distU, const vll &distV) {
vll dist(n, INF);
priority_queue<pair<ll, pll>, vector<pair<ll, pll>>, greater<>> pq;
dist[s] = 0;
pq.push({dist[s], {s, -1}});
vll dp(n, INF), dp2(n, INF);
while(!pq.empty()) {
auto tren = pq.top();
pq.pop();
ll raz = tren.fi;
ll cvor = tren.se.fi;
ll rod = tren.se.se;
if(raz != dist[cvor]) continue;
ckmin(dp[cvor], distU[cvor]);
ckmin(dp2[cvor], distV[cvor]);
if(rod != -1) {
if(dp[rod] + dp2[rod] <= dp[cvor] + dp2[cvor]) {
dp[cvor] = min(dp[cvor], dp[rod]);
dp2[cvor] = min(dp2[cvor], dp2[rod]);
}
}
for(auto e : adj[cvor]) {
if(ckmin(dist[e.fi], dist[cvor] + e.se)) {
pq.push({dist[e.fi], {e.fi, cvor}});
}
}
}
// dbg(dp);
// dbg(dp2);
return dp[t] + dp2[t];
}
void solve() {
int n, m;
cin >> n >> m;
int s, t, u, v;
cin >> s >> t >> u >> v;
--s, --t, --u, --v;
for(int i = 0; i < m; ++i) {
int a, b, w;
cin >> a >> b >> w;
--a, --b;
adj[a].pb({b, w});
adj[b].pb({a, w});
}
auto distU = dijkstra(n, u);
auto distV = dijkstra(n, v);
dbg(distU, distV);
ll ans = distU[v];
ckmin(ans, resi(n, s, t, distU, distV));
cout << ans << nl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int testCases = 1;
//cin >> testCases;
while(testCases--)
solve();
}
