#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i)
#define RFOR(i, x, n) for (ll i =x; i>=n; --i)
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll n, m, ss, tt, uu, vv;
ll const INF = 1e15;
vector<pi> adj[100005];
void dijkstra(ll from, vector<ll> & dist)
{
dist.assign(n + 1, INF);
dist[from] = 0;
priority_queue<pi, vector<pi>, greater<pi> > pq;
pq.push(mp(0, from));
while (pq.size())
{
ll c = pq.top().s, d = pq.top().f;
pq.pop();
if( dist[c] < d) continue;
for (pi u: adj[c])
{
if (dist[u.f] > dist[c] + u.s)
{
dist[u.f] = dist[c] + u.s;
pq.push(mp(dist[u.f], u.f));
}
}
}
}
int main()
{
cin >> n >> m >> ss >> tt >> uu >> vv;
for (ll i=0; i<m; ++i)
{
ll u, v, w;
cin >> u >> v >> w;
adj[u].pb(mp(v, w));
adj[v].pb(mp(u, w));
}
vector<ll> d1, d2, d3, d4;
dijkstra(uu, d1); dijkstra(vv, d2); dijkstra(ss, d3); dijkstra(tt, d4);
ll ans = d1[vv];
vector<ll> dist(n + 1, INF), dist2(n + 1, INF);
vector<pi> node;
for (ll i=1; i<=n; ++i) node.pb(mp(d3[i], i));
sort(all(node));
for (ll i=0; i<n; ++i)
{
ll now = node[i].s;
for (pi u: adj[now])
{
if (d3[u.f] + d4[now] + u.s == d3[tt])
{
dist[now] = min(dist[now], dist[u.f]);
dist2[now] = min(dist2[now], dist2[u.f]);
}
}
ans = min(ans, dist[now] + d2[now]);
ans = min(ans, dist2[now] + d1[now]);
dist[now] = min(dist[now], d1[now]);
dist2[now] = min(dist2[now], d2[now]);
}
cout << ans << endl;
return 0;
}
