#include <bits/stdc++.h>
using namespace std;
ifstream fin("sate.in");
ofstream fout("sate.out");
const int MAX = 30005;
const int INF = 1e9;
vector < pair <int ,int > > G[MAX];
deque < int > lx;
int D[MAX];
inline void bfs( )
{
    int x;
    while(!lx.empty()){
        x = lx.front();
        lx.pop_front();
        for(int i = 0; i < G[x].size(); i ++){
            if(D[G[x][i].first] >  D[x] + G[x][i].second){
                D[G[x][i].first] = D[x] + G[x][i].second;
                lx.push_back(G[x][i].first);
            }
        }
    }
}
int main()
{
    int n,m,s,f,x,y,d;
    fin >> n >> m >> s >> f;
    for(int i = 0 ; i < m; i ++){
        fin >> x >> y >> d;
        G[x].push_back(make_pair(y,d));
        G[y].push_back(make_pair(x,-d));
    }
    lx.push_back(s);
    for(int  i = 1; i <= n; i++)
        D[i] = INF;
    D[s] = 0;
    bfs();
    fout << D[f] ;

    return 0;
}