#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#ifdef debug
#define dbg(...) cerr<<#__VA_ARGS__<<" = ", de(__VA_ARGS__)
template<typename T>
void de(T t) {cerr<<t<<endl;}
template<typename T, typename ...U>
void de(T t, U...u) {cerr<<t<<", ", de(u...);}
#else
#define dbg(...)
#define endl "\n"
#endif
void usaco(string s) {
freopen((s+".in").c_str(), "r", stdin);
freopen((s+".out").c_str(), "w", stdout);
}
const int mxN=1e5;
vector<pair<ll, ll>> adj[mxN];
vector<ll> s, t, u, v;
ll ans, dp[mxN], dp1[mxN];
int S, T, U, V;
vector<ll> dij(int x) {
vector<ll> dist(mxN, 1e18);
priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> pq;
pq.push({0, x});
dist[x]=0;
while(pq.size()) {
auto [dis, y]=pq.top();
pq.pop();
if(dis>dist[y]) continue;
for(auto [z, w] : adj[y]) {
if(dis+w<dist[z]) {
dist[z]=dis+w;
pq.push({dist[z], z});
}
}
}
return dist;
}
void dfs(int x) {
if(dp[x]==-1) {
dp[x]=1e18;
if(s[x]+t[x]==s[T]) { dp[x]=min(dp[x], v[x]);//
for(auto [y, w] : adj[x]) {
if(s[x]+w==s[y]) {
dfs(y);
dp[x]=min(dp[x], dp[y]);
ans=min(ans, dp[x]+u[x]);
dbg(ans, x+1, dp[x], v[x]);
}
}
}
}
}
void dfs1(int x) {
if(dp1[x]==-1) {
dp1[x]=1e18;
if(s[x]+t[x]==t[S]) { dp1[x]=min(dp1[x], v[x]);
for(auto [y, w] : adj[x]) {
if(t[x]+w==t[y]) {
dfs1(y);
dp1[x]=min(dp1[x], dp1[y]);
ans=min(ans, dp1[x]+u[x]);
dbg(ans, x+1, dp1[x], u[x]);
}
}
}
}
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int n, m; cin>>n>>m;
cin>>S>>T>>U>>V;
--S, --T, --U, --V;
for(int i=0; i<m; i++) {
int a, b, c; cin>>a>>b>>c;
--a, --b;
adj[a].push_back({b, c});
adj[b].push_back({a, c});
}
s=dij(S);
t=dij(T);
u=dij(U);
v=dij(V);
ans=u[V];
memset(dp, -1, sizeof(dp));
memset(dp1, -1, sizeof(dp1));
dfs(S);
dfs1(T);
cout<<ans;
return 0;
}
//rating below 2700 must be solved orzorzorz
