#include<bits/stdc++.h>
using namespace std;
ifstream fin("sate.in");
ofstream fout("sate.out");

int n, m, start, finish, dist[30001];
vector<pair<int, int>> v[30001];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

int main()
{
    fin >> n >> m >> start >> finish;

    for(int i=1; i<=m;++i)
    {
        int x, y, c;
        fin >> x >> y >> c;
        v[x].push_back({y, c});
        v[y].push_back({x, -c});
    }

    for(int i = 1; i<=n; ++i)
        dist[i] = 1<<30;

    pq.push({0,start});
    dist[start] = 0;

    while(!pq.empty())
    {
        pair<int, int> x = pq.top();
        pq.pop();

        for(int i=0; i<v[x.second].size(); ++i)
            if(dist[v[x.second][i].first] > dist[x.second] + v[x.second][i].second)
            {
                dist[v[x.second][i].first] = dist[x.second] + v[x.second][i].second;
                pq.push({dist[v[x.second][i].first], v[x.second][i].first});
            }
    }

    fout << dist[finish];

    return 0;
}