#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
const int NMAX = 30000;
struct muchii
{
    int nod , d;
};
muchii temp;
vector <muchii> G[NMAX + 5];
int d[NMAX + 5] , viz[NMAX + 5];
void bfs(int u)
{
    int v , j;
    viz[u] = 1;
    queue <int> q;
    q.push(u);
    while(!q.empty())
    {
        u = q.front();
        q.pop();
        for(j = 0 ; j < G[u].size() ; j ++)
        {
            v = G[u][j].nod;
            if(viz[v] == 0)
            {
                d[v] = d[u] + G[u][j].d;
                viz[v] = 1;
                q.push(v);
            }
        }
    }
}
int main()
{
    freopen("sate.in" , "r" , stdin);
    freopen("sate.out" , "w" , stdout);
    int n , m , start , finish , x , y , z , i;
    scanf("%d%d%d%d" , &n , &m , &start , &finish);
    for(i = 1 ; i <= m ; i ++)
    {
        scanf("%d%d%d" , &x , &y , &z);
        temp.nod = y;
        temp.d = z;
        G[x].push_back(temp);
        temp.nod = x;
        temp.d = -z;
        G[y].push_back(temp);
    }
    bfs(start);
    printf("%d\n" , d[finish]);
    return 0;
}