#include<bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int n, m, s, t, cs, ct, x, y, z;
int main() {
scanf("%d %d %d %d %d %d", &n, &m, &s, &t, &cs, &ct);
vector<vector<pii>> v(n + 5, vector<pii>());
while (m--) scanf("%d %d %d", &x, &y, &z), v[x].emplace_back(y, z), v[y].emplace_back(x, z);
vector<int> d(n + 5, 1e9), par(n + 5);
priority_queue<pii, vector<pii>, greater<pii>> pq;
pq.emplace(d[s] = 0, s);
while (!pq.empty()) {
auto [nd, nn] = pq.top(); pq.pop();
for (auto &[tn, td]: v[nn]) if (d[tn] > d[nn] + td) par[tn] = nn, pq.emplace(d[tn] = d[nn] + td, tn);
}
vector<int> u{t};
while (par[u.back()]) u.emplace_back(par[u.back()]);
for (auto &e: u) v[n + 1].emplace_back(e, 0), v[e].emplace_back(n + 1, 0);
vector<int> d2(n + 5, 1e9);
pq.emplace(d2[cs] = 0, cs);
while (!pq.empty()) {
auto [nd, nn] = pq.top(); pq.pop();
for (auto &[tn, td]: v[nn]) if (d2[tn] > d2[nn] + td) pq.emplace(d2[tn] = d2[nn] + td, tn);
}
printf("%d", d2[ct]);
}
