#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INF=LONG_LONG_MAX;
ll m, n, s, t, u, v;
vector<pair<ll, ll> >graff[100010];
vector<ll>dag[100010];
bool check1[100010], check2[100010];
ll distu[100010], distv[100010], dists[100010], distt[100010];
ll res=INF;
void dijkstra(ll cvor, ll *dist)
{
for(int i=0; i<100010; i++){check1[i]=false; dist[i]=INF;}
priority_queue<pair<ll, ll> >ord;
dist[cvor]=0;
ord.push({0, cvor});
while(!ord.empty())
{
int cv=ord.top().second;
ord.pop();
if(check1[cv])continue;
check1[cv]=true;
for(int j=0; j<graff[cv].size(); j++)
{
ll pp=graff[cv][j].first;
dist[pp]=min(dist[pp], dist[cv]+graff[cv][j].second);
ord.push({-dist[pp], pp});
}
}
}
void dfs1(ll prosli, ll cvor)
{
if(dists[cvor]+distt[cvor]!=dists[t])return;
if(dists[cvor]-dists[prosli]<0)return;
dag[prosli].push_back(cvor);
if(cvor==t)return;
for(int i=0; i<graff[cvor].size(); i++)
{
dfs1(cvor, graff[cvor][i].first);
}
return;
}
void dfs2(ll cvor, ll minv, ll minu)
{
if(cvor==t)return;
minv=min(minv, distv[cvor]);
minu=min(minu, distu[cvor]);
res=min(res, minv+minu);
for(int i=0; i<dag[cvor].size(); i++)
{
dfs2(dag[cvor][i], minv, minu);
}
return;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(); cout.tie();
cin>>n>>m;
cin>>s>>t;
cin>>u>>v;
ll a, b, c;
for(int i=0; i<m; i++)
{
cin>>a>>b>>c;
graff[a].push_back({b, c});
graff[b].push_back({a, c});
}
dijkstra(u, distu);
dijkstra(v, distv);
dijkstra(s, dists);
dijkstra(t, distt);
dists[0]=0;
dfs1(0, s);
dfs2(s, INF, INF);
/*for(int i=1; i<=8; i++)
{
for(int j=0;j<dag[i].size(); j++)cout<<i<<" "<<dag[i][j]<<endl;
cout<<endl;
}*/
cout<<min(res, distv[u]);
return 0;
}
