#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
using namespace std;

#define FILE_NAME "sate"
ifstream in (FILE_NAME".in");
ofstream out(FILE_NAME".out");

constexpr int MAX_NODES = 30000 + 4;
vector < pair < int, int > > G[MAX_NODES];
bitset < MAX_NODES > Viz;
int N, M, X, Y;

queue < pair < int, int > > Q;
int Lee()
{
    Q.push(make_pair(X, 0));
    Viz[X] = true;
    int nod, dist;
    while(!Q.empty())
    {
        nod = Q.front().first;
        dist = Q.front().second;
        Q.pop();

        for(auto next : G[nod])
            if(!Viz[next.first])
            {
                if(next.first == Y)
                    return dist + next.second;

                Viz[next.first] = true;
                Q.push(make_pair(next.first, next.second + dist));
            }
    }
    return 0;
}

int main()
{
    in >> N >> M >> X >> Y;

    int a, b, c;
    while(M--)
    {
        in >> a >> b >> c;
        if(a < b)
        {
            G[a].push_back(make_pair(b, c));
            G[b].push_back(make_pair(a, -c));
        }
        else
        {
            G[a].push_back(make_pair(b, -c));
            G[b].push_back(make_pair(a, c));
        }
    }

    out << abs(Lee());

    return 0;
}