#include <fstream>
#define N 30002
#include <vector>
#include <queue>
#define INF 2000000000

using namespace std;
ifstream f("sate.in");
ofstream g("sate.out");

struct bla
{
    int ve,co;
};
vector <bla> graph[N];

struct cmp
{
    bool operator()(bla A, bla B)
    {
        return (A.co>B.co);
    }
};
priority_queue <bla, vector<bla>,cmp> q;
bool viz[N];
int dist[N];

int main()
{
    int n,m,x,y,X,Y,c,nod;
    f>>n>>m>>X>>Y;
    for(int i=1;i<=n;++i)
    {
        f>>x>>y>>c;
        graph[x].push_back({y,c});
        graph[y].push_back({x,-c});
    }
    if(X>Y) swap(X,Y);
    for(int i=1;i<=n;++i) dist[i]=INF;
    for(int i=1;i<=n;++i)
    {
        if(!viz[i])
        {
            q.push({i,0});
            dist[i]=0;
            while(!q.empty())
            {
                nod=q.top().ve;
                q.pop();
                if(!viz[nod])
                {
                    for(int j=0;j<graph[nod].size();++j)
                    {
                        int vee=graph[nod][j].ve;
                        int cost=dist[nod]+graph[nod][j].co;
                        if(dist[vee]>cost)
                        {
                            dist[vee]=cost;
                            q.push({vee,cost});
                            if(dist[X]!=INF && vee==Y)
                            {
                                g<<dist[Y];
                                return 0;
                            }

                        }
                    }
                    viz[nod]=1;
                }
            }
        }
    }
    f.close();
    g.close();
    return 0;
}