#include<bits/stdc++.h>
#define int long long
#define F first
#define S second
using namespace std;
using pi=pair<int,int>;
const int inf=1e18;
int n,m;
int S,T,U,V;
vector<pi> g[100005];
vector<int> dijk(int s){
vector<int> dis(n+1,inf);
priority_queue<pi,vector<pi>,greater<pi>> pq;
dis[s]=0;
pq.push({0,s});
while(!pq.empty()){
auto [du,u]=pq.top();
pq.pop();
if(du!=dis[u])
continue;
for(auto [v,w]:g[u]){
if(dis[v]>du+w){
dis[v]=du+w;
pq.push({du+w,v});
}
}
}
return dis;
}
main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m >> S >> T >> U >> V;
for(int i=0,a,b,c;i<m;i++){
cin >> a >> b >> c;
g[a].push_back({b,c});
g[b].push_back({a,c});
}
vector<int> s=dijk(S),t=dijk(T),u=dijk(U),v=dijk(V);
vector<int> dpu(n+1,inf),dpv(n+1,inf);
vector<pi> vec;
for(int i=1;i<=n;i++){
if(s[i]+t[i]==s[T])
vec.push_back({s[i],i});
}
sort(vec.begin(),vec.end());
int ans=inf;
for(auto [si,i]:vec){
dpu[i]=u[i];
dpv[i]=v[i];
for(auto [j,w]:g[i]){
if(s[j]+w+t[i]==s[T]){
dpu[i]=min(dpu[i],dpu[j]);
dpv[i]=min(dpv[i],dpv[j]);
}
}
ans=min(ans,dpu[i]+v[i]);
ans=min(ans,dpv[i]+u[i]);
}
ans=min(ans,u[V]);
cout << ans;
}
