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

using namespace std;

struct Nr
{
    int sat,cost;
};
vector <Nr> v[30005];
queue <int> q;

int d[30005],N,X,Y;

inline void Read()
{
    int M,i,x,y,dist;
    Nr w;
    ifstream fin("sate.in");
    fin>>N>>M>>X>>Y;
    for(i=1;i<=M;i++)
    {
        fin>>x>>y>>dist;
        w.sat=x;w.cost=dist;
        v[y].push_back(w);
        w.sat=y;
        v[x].push_back(w);
    }
    fin.close();
}

inline void Solve()
{
    int i,j,k,c;
    q.push(X);
    for(i=1;i<=N;i++)
        d[i]=-1;
    d[X]=0;
    while(!q.empty())
    {
        j=q.front();
        q.pop();
        for(i=0;i<v[j].size();i++)
        {
            k=v[j][i].sat;
            c=v[j][i].cost;
            if(d[k]<0)
            {
                if(j<k)
                    d[k]=d[j]+c;
                else
                    d[k]=d[j]-c;
                q.push(k);
                if(k==Y)
                   return ;
            }
        }
    }
}

int main()
{
    Read();
    Solve();
    ofstream fout("sate.out");
    fout<<d[Y]<<"\n";
    fout.close();
    return 0;
}