#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("sate.in");
ofstream out("sate.out");
int n,m,x,y,a,b,c,dist[30005];
vector <pair<int,int> > v[30005];
int rez()
{
    queue<int> q;
    q.push(x);
    while(!q.empty())
    {
        int x1=q.front();
        q.pop();
        for(auto i:v[x1])
        {
            if(dist[i.first]==0)
            {
                dist[i.first]=dist[x1]+i.second;
                q.push(i.first);
                if(i.first==y)return dist[y];
            }
        }
    }
}
int main()
{
    in>>n>>m>>x>>y;
    for(int i=1;i<=m;i++)
    {
        in>>a>>b>>c;
        v[a].push_back({b,c});
        v[b].push_back({a,-c});
    }
    out<<rez();
    return 0;
}