#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vb vector<bool>
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define endl '\n'
#define maxx(x) *max_element(all(x))
#define pii pair<int,int>
#define minn(x) *min_element(all(x))
#define vpii vector<pii>
#define di deque<int>
#define mii map<int,int>
#define vap(x) vector<array<int,x>>
constexpr int MOD = (1e9 + 7);
constexpr int inf = 1e18;
void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
}
ostream& operator<<(ostream& out, vi& a) {
for (int i = 0; a.size() > i; i++)out << a[i] << ' ';
return out;
}
ostream& operator<<(ostream& out, vector<vi>& a) {
for (auto& row : a) {
for (auto& elem : row) out << elem << ' ';
out << '\n';
}
return out;
}
istream& operator>>(istream& in, vi& a) {
for (int i = 0; a.size() > i; i++) in >> a[i];
return in;
}
istream& operator>>(istream& in, vector<vi>& a) {
for(int i = 0;i<a.size();i++){
for(int j = 0;j<a[i].size();j++){
in >> a[i][j];
}
}
return in;
}
int sumofvecor(vi a){
int sm = 0;
for(int i = 0;i<a.size();i++)sm+=a[i];
return sm;
}
bool isprime(int number){
for(int i = 2;i*i<=number;i++){
if(number%i==0)return false;
}
return number>=2;
}
void file_io() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
void solve();
signed main(signed argc, char *argv[]) {
clock_t start = clock();
fast_io();
// file_io();
if (argc > 1 && string(argv[1]) == "gg") file_io();
int test = 1;
// cin >> test;
while (test--) {
solve();
}
cerr << "Vaqt " << double(clock() - start) / double(CLOCKS_PER_SEC) * 1000 << " ms\n";
}
void solve(){
int n,m;
cin>>n>>m;
int s,t,u,v;
cin>>s>>t>>u>>v;
vector<vpii> g(n+1);
vap(3) edges(m);
for(int i = 0;i<m;i++){
int a,b,c;
cin>>a>>b>>c;
g[a].push_back({b,c});
g[b].push_back({a,c});
edges[i]={a,b,c};
}
auto dijkstra = [&](int iv){
priority_queue<pii,vector<pii>,greater<pii>> q;
vi dis(n+1,inf);
dis[iv]=0;
q.push({0,iv});
while(!q.empty()){
auto [d,cv]=q.top();
q.pop();
if(d!=dis[cv])continue;
for(auto [cu,disi]:g[cv]){
if(dis[cu]>disi+d){
dis[cu]=disi+d;
q.push({dis[cu],cu});
}
}
}
return dis;
};
vi diss = dijkstra(s),dist = dijkstra(t),disu = dijkstra(u),disv = dijkstra(v);
// cout<<dist<<endl;
vvi dag(n+1);
for(auto [a,b,c]:edges){
if(diss[a]+c+dist[b]==diss[t]){
dag[b].push_back(a);
}
if(diss[b]+c+dist[a]==diss[t]){
dag[a].push_back(b);
}
}
vi ord(n);
iota(all(ord),1);
auto comp = [&](int i,int j){
// cout<<i<<' '<<j<<endl;
return dist[i]<dist[j];
};
// cout<<ord<<endl;
sort(all(ord),comp);
// cout<<ord<<endl;
// cout<<dag<<endl;
vi mnu(n+1,inf),mnv(n+1,inf);
mnu[t]=disu[t],mnv[t]=disv[t];
for(int i:ord){
mnu[i]=min(mnu[i],disu[i]);
mnv[i]=min(mnv[i],disv[i]);
for(int to:dag[i]){
mnu[to]=min(mnu[to],mnu[i]);
mnv[to]=min(mnv[to],mnv[i]);
}
}
cout<<mnu[1]+mnv[1]<<endl;
}
