#include <bits/stdc++.h>
#define nmax 30001

using namespace std;

ifstream fin("sate.in");
ofstream fout("sate.out");

int d[nmax];
int n, m;
int x, y;
bool viz[nmax];
queue <int> q;

vector < pair < int,int  > > muchii[nmax];

void citeste()
{
    fin >> n >> m >> x >> y;
    for (int i = 1; i<= m; i++)
    {
        int a, b, c;
        fin >> a >> b >> c;
        muchii[a].push_back(make_pair(b,c));
        muchii[b].push_back(make_pair(a,c));
    }
}

inline void bfs()
{
    viz[x] = true;
    q.push(x);
    while (!q.empty())
    {
        int nod = q.front();
        q.pop();
        for (auto v : muchii[nod])
        {
            int vecin = v.first;
            int cost = v.second;
            if (!viz[vecin])
            {
                viz[vecin] = true;
                q.push(vecin);
                if (vecin > nod)
                    d[vecin] = d[nod] + cost;
                else
                    d[vecin] = d[nod] - cost;
                if (vecin == y)
                    return;
            }
        }
    }
}

int main()
{
    citeste();
    bfs();
    fout << d[y];
    return 0;
}