#include <iostream>
#include <fstream>
#include <queue>
#include <unordered_map>

using namespace std;

typedef pair<short,int> paer;
short x, y;
int sol;

deque<paer> vecini[30001];
unordered_map<short,int> distante;

void df(short sat) {
    if (sat == y) {
        sol = distante[sat];
    }

    for (int i=0; i<vecini[sat].size() && !sol; i++) {
        if (sat != x && !distante[vecini[sat][i].first]) {
            if (sat > vecini[sat][i].first) {
                distante[vecini[sat][i].first] = distante[sat] - vecini[sat][i].second;
            }
            else {
                distante[vecini[sat][i].first] = distante[sat] + vecini[sat][i].second;
            }

            df(vecini[sat][i].first);
        }
    }
}

int main()
{
    ifstream in("sate.in");
    ofstream out("sate.out");

    short n, a, b;
    int d, i, m;
    in>>n>>m>>x>>y;

    for (i=0; i<m; i++) {
        in>>a>>b>>d;
        vecini[a].push_back(paer(b,d));
        vecini[b].push_back(paer(a,d));
    }

    //df(x);
    out<<sol;

    in.close();
    out.close();
    return 0;
}