// from duckindog wth depression
#include<bits/stdc++.h>
using namespace std;
#define int long long
using pii = pair<int, int>;
using T = tuple<int, int, int>;
const int N = 1e5 + 10;
int n, m;
int s, t, u, v;
vector<pair<int, int>> ad[N];
int f[N], sv[N];
void sktra(int x) {
memset(f, 40, sizeof f);
priority_queue<pii, vector<pii>, greater<pii>> q;
q.emplace(f[x] = 0, x);
while (q.size()) {
int dis, u; tie(dis, u) = q.top(); q.pop();
if (dis != f[u]) continue;
for (auto duck : ad[u]) {
int v, w; tie(v, w) = duck;
if (f[v] > dis + w)
q.emplace(f[v] = dis + w, v);
}
}
}
int d[N][3];
void dijsktra(int x) {
memset(d, 40, sizeof d);
priority_queue<T, vector<T>, greater<T>> q;
q.emplace(d[x][0] = 0, x, 0);
while (q.size()) {
int dis, u, st; tie(dis, u, st) = q.top(); q.pop();
if (dis != d[u][st]) continue;
for (auto duck : ad[u]) {
int v, w; tie(v, w) = duck;
bool onpath = sv[u] + f[v] + w == sv[t];
{
if (d[v][st] > dis + w) {
q.emplace(d[v][st] = dis + w, v, st);
}
}
if (onpath && st <= 1) {
if (d[v][1] > dis) {
q.emplace(d[v][1] = dis, v, 1);
}
}
{
if (d[v][2] > dis + w) {
q.emplace(d[v][2] = dis + w, v, 2);
}
}
}
}
}
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
if (fopen("duck.inp", "r")) {
freopen("duck.inp", "r", stdin);
freopen("duck.out", "w", stdout);
}
cin >> n >> m;
cin >> s >> t >> u >> v;
for (int i = 1; i <= m; ++i) {
int a, b, c; cin >> a >> b >> c;
ad[a].push_back({b, c});
ad[b].push_back({a, c});
}
sktra(s);
for (int i = 1; i <= n; ++i) sv[i] = f[i];
sktra(t);
int answer = LLONG_MAX;
dijsktra(u);
answer = min({answer, d[v][0], d[v][1], d[v][2]});
cout << answer;
}
