/*
███████╗██████╗ █████╗
██╔════╝██╔══██╗██╔══██╗
███████╗██████╔╝███████║ --- incredible
██╔════╝██╔═══╝ ██╔══██║
███████╗██║ ██║ ██║
╚══════╝╚═╝ ╚═╝ ╚═╝
*/
#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define all(v) (v).begin(),(v).end()
#define F first
#define S second
#define pb push_back
#define popb pop_back
#define ss sort
#define rr reverse
#define pii pair <int, int>
#define pll pair <ll, ll>
using namespace std;
using ld = long double;
using ll = long long;
const int N = 3e5+10;
const ll inf = 1e18;
const int Mod = 1e9+7;
const int P = 273;
int n, m, S, T, U, V;
vector <pii> g[N];
map <pii, bool> was;
ll bfs(int v, bool type = 0)
{
set <pll> st;
vector <ll> dist(n+1, inf), p(n+1, 0);
st.insert({0, v});
dist[v] = 0;
while (!st.empty())
{
auto [d, u] = *st.begin();
st.erase(st.begin());
if (dist[u] < d) continue;
for (auto &[to, w] : g[u])
{
if (was[{u, to}]) w = 0;
if (dist[to] > d + w)
{
dist[to] = d + w;
st.insert({dist[to], to});
p[to] = u;
}
}
}
if (type)
{
int x = T;
while (p[x] != 0)
{
was[{x, p[x]}] = was[{p[x], x}] = 1;
// cout << x << " " << p[x] << "\n";
x = p[x];
}
return x;
}
return dist[V];
}
void Erali_is_the_best(int testCase)
{
cin >> n >> m >> S >> T >> U >> V;
for (int i = 1, u, v, w; i <= m; ++i)
{
cin >> u >> v >> w;
g[u].pb({v, w});
g[v].pb({u, w});
}
bfs(S, 1);
cout << bfs(U) << "\n";
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen("cardgame.in","r",stdin);
// freopen("cardgame.out","w",stdout);
int tt = 1;
// cin >> tt;
for (int test = 1; test <= tt; ++test)
{
Erali_is_the_best(test);
}
}
