#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int S, T, U, V;
int n, m;
VVPI gp;
void dijkstra(int s, VL& dist) {
dist = VL(n, 1e18);
priority_queue<PLL> pq;
VI vis(n);
dist[s] = 0;
pq.push({0, s});
while (pq.size()) {
int u = pq.top().ss;
pq.pop();
if (vis[u]) continue;
vis[u] = true;
for (auto[v, w] : gp[u]) {
if (dist[u] + w < dist[v]) {
dist[v] = dist[u] + w;
pq.push({-dist[v], v});
}
}
}
}
void solve() {
cin >> n >> m;
cin >> S >> T >> U >> V;
S--, T--, U--, V--;
gp = VVPI(n);
rep(i, m) {
int u, v, c;
cin >> u >> v >> c;
u--, v--;
gp[u].pb({v, c});
gp[v].pb({u, c});
}
VL dists, distt, distu, distv;
dijkstra(S, dists);
dijkstra(T, distt);
dijkstra(U, distu);
dijkstra(V, distv);
ll mindist = dists[T];
ll ans = 1e18;
rep(u, n) {
/*if laying on mindist route*/
if (dists[u] + distt[u] == mindist) {
setmin(ans, distv[u]);
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int t = 1;
/*cin >> t;*/
while (t--) solve();
}
