#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<long long, long long>
#define t3i tuple<long long, long long, long long>
int n, m, S, T, U, V;
vector<vector<pii>> g;
vector<int> halt() {
priority_queue<t3i, vector<t3i>, greater<t3i>> q;
q.push({0, S, -1});
vector<int> d(n, 1e17), prev(n);
while (!q.empty()) {
auto [dv, v, par] = q.top();
q.pop();
if (d[v] <= dv) continue;
d[v] = dv;
prev[v] = par;
for (auto [c, u] : g[v]) {
q.push({dv + c, u, v});
}
}
vector<int> hal;
int t = T;
while (t != -1) {
hal.push_back(t);
t = prev[t];
}
return hal;
}
int bfs(int v, vector<int> &goal) {
priority_queue<pii, vector<pii>, greater<pii>> q;
q.push({0, v});
vector<int> d(n, 1e17);
while (!q.empty()) {
auto [dv, v] = q.top();
q.pop();
if (d[v] <= dv) continue;
d[v] = dv;
for (auto [c, u] : g[v]) {
q.push({dv + c, u});
}
}
int ans = 1e17;
for (int x : goal) {
ans = min(ans, d[x]);
}
return ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m >> S >> T >> U >> V;
S--, T--, U--, V--;
g.resize(n);
for (int i = 0; i < m; i++) {
int x, y, c;
cin >> x >> y >> c;
x--; y--;
g[x].push_back({c, y});
g[y].push_back({c, x});
}
vector<int> hal = halt(), uvec(1, U);
cout << min(bfs(U, hal) + bfs(V, hal), bfs(V, uvec)) << "\n";
}
