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

using namespace std;

vector <int> graf[30001];
ifstream f("sate.in");
ofstream g("sate.out");
int n,m,nodinit,nodfin,minim,d[30001];

void dfs(int nod,int dist)
{
    int i;
    if(nod==nodfin) {if((!minim) || (dist<minim)) minim=dist;}
    else if(!d[nod])
            {
                d[nod]=1;
                for(i=0;i<graf[nod].size();i+=2)
                    {
                        dfs(graf[nod][i],dist+graf[nod][i+1]);
                    }
            }
}
int main()
{   int x,y,dis;

    f>>n>>m>>nodinit>>nodfin;

    for(int i=1;i<=m;i++)
    {
        f>>x>>y>>dis;
        graf[x].push_back(y);
        graf[x].push_back(dis);
        graf[y].push_back(x);
        graf[y].push_back(-dis);
    }

    dfs(nodinit,0);

    g<<minim;

    return 0;
}