#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

int n, m, x, y, viz[30005];
vector <int> v[30005], d[30005];
queue <short> q;

void bfs()
{
    int z;
    q.push(x);
    while(!q.empty())
    {
        z = q.front();
        for(unsigned i=0; i<v[z].size(); i++)
            if(!viz[v[z][i]])
            {
                viz[v[z][i]] = viz[z] + d[z][i];
                q.push(v[z][i]);
                if(y == v[z][i]) return;
            }
        q.pop();
    }
}

int main()
{
    fin>>n>>m>>x>>y;
    int a, b, l;
    while(m--)
    {
        fin>>a>>b>>l;
        v[a].push_back(b);
        v[b].push_back(a);
        d[a].push_back(l);
        d[b].push_back(-l);
    }

    bfs();
    fout<<viz[y];
    return 0;
}