#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include<set>
#include<cstring>

using namespace std;
typedef long long ll;

struct movestruct {
    int dist, curr, prev, road_id;
    bool operator<(const movestruct& rhs) const {
        return dist < rhs.dist;
    }
};

int main(){
    int n, m, a, b;
    cin >> n >> m >> a >> b;

    vector<vector<pair<int, int>>> adj(n+1);
    vector<int> length(m);
    for(int i = 0; i < n+1; i++){
        vector<pair<int, int>> nv; adj[i] = nv;
    }

    int total_length = 0;

    for(int i = 0; i < m; i++){
        int i1, i2, l;
        cin >> i1 >> i2 >> l;
        i1--; i2--;

        // cout << i1 << " " << i2 << " " << l << endl;

        adj[i1].push_back(make_pair(i2, i));
        adj[i2].push_back(make_pair(i1, i));

        // cout << i1 << " " << i2 << " " << l << endl;

        length[i] = l;
        total_length += l;
    }

    priority_queue<movestruct> pq;
    vector<int> min_dist(n+1, -1);
    vector<set<int>> involved_roads(n+1);

    for(int i = 0; i < n + 1; i++){
        set<int> s; involved_roads[i] = s;
    }

    a--; b--;

    pq.push({0, 0, 0, -1});

    while(!pq.empty()){
        movestruct m = pq.top();
        pq.pop();

        // cout << "Visiting node m: " << m.dist << " " << m.curr << " " << m.prev << " " << m.road_id << endl;
        if(min_dist[m.curr] == m.dist){
            // cout << "       Same as previous length" << endl;

            // Add this information to the set
            min_dist[m.curr] = m.dist;
            involved_roads[m.curr].insert(involved_roads[m.prev].begin(), involved_roads[m.prev].end());
            involved_roads[m.curr].insert(m.road_id);

            for(auto ni: adj[m.curr]){
                // cout << "       Pushing to priority queue: " << ni.first << " with road id: " << ni.second << endl;
                pq.push({m.dist + length[ni.second], ni.first, m.curr, ni.second});
            }
        } else if (min_dist[m.curr] == -1 || min_dist[m.curr] > m.dist) {
            // Overwrite - this path is shorter
            // cout << "           Unseen or shorter path: " << adj[m.curr].size() << endl;
            min_dist[m.curr] = m.dist;
            set<int> new_set; new_set.insert(involved_roads[m.prev].begin(), involved_roads[m.prev].end());
            new_set.insert(m.road_id);
            involved_roads[m.curr] = new_set;

            for(auto ni: adj[m.curr]){
                // cout << "       Pushing to priority queue: " << ni.first << " with road id: " << ni.second << endl;
                pq.push({m.dist + length[ni.second], ni.first, m.curr, ni.second});
            }
        }
    }

    int total_length_paved = 0;

    for(auto i: involved_roads[b]){
        if(i == -1){
            continue;
        }
        total_length_paved += length[i];
        // cout << i << endl;
    }
    cout << total_length - total_length_paved << endl;

    return 0;
}