#include <bits/stdc++.h>
//#include "factories.h"
//#include "wall.h"
#define f first
#define s second
#define int long long
using namespace std;
const int maxn = 1e5 + 69;
vector<pair<int, int>> g[maxn];
int n, m, s, t, u, v;
const int inf = 1e18;
vector<int> d(maxn, inf);
vector<int> du(maxn, inf), dv(maxn, inf);
vector<int> in(maxn, inf), out(maxn, inf);
vector<int> vis(maxn);
vector<tuple<int, int, int>> edges;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while(tt--) {
cin >> n >> m >> s >> t >> u >> v;
for(int i = 0;i < m;i++) {
int a, b, c;
cin >> a >> b >> c;
g[a].push_back({b, c});
g[b].push_back({a, c});
edges.push_back({a, b, c});
}
d[s] = du[u] = dv[v] = 0;
priority_queue<pair<int, int>> pq;
pq.push({0, u});
while(!pq.empty()) {
auto u = pq.top();
pq.pop();
for(auto v : g[u.s]) {
if(du[v.f] <= du[u.s] + v.s)
continue;
du[v.f] = du[u.s] + v.s;
pq.push({-du[v.f], v.f});
}
}
pq.push({0, v});
while(!pq.empty()) {
auto u = pq.top();
pq.pop();
for(auto v : g[u.s]) {
if(dv[v.f] <= dv[u.s] + v.s)
continue;
dv[v.f] = dv[u.s] + v.s;
pq.push({-dv[v.f], v.f});
}
}
pq.push({0, s});
for(int i = 1;i <= n;i++) {
in[i] = du[i];
out[i] = dv[i];
}
while(!pq.empty()) {
auto u = pq.top();
pq.pop();
for(auto v : g[u.s]) {
if(d[v.f] < d[u.s] + v.s)
continue;
in[v.f] = min(in[v.f], in[u.s]);
out[v.f] = min(out[v.f], out[u.s]);
if(d[v.f] == d[u.s] + v.s)
continue;
d[v.f] = d[u.s] + v.s;
pq.push({-d[v.f], v.f});
}
}
cout << min(du[v], in[t] + out[t]);
}
return 0;
}
