#include <fstream>
#include <queue>
#include <vector>
using namespace std;
FILE *in=fopen("sate.in","r");
FILE *out=fopen("sate.out","w");
long const N=30001;
unsigned short n,m,x,y;
bool viz[N];
unsigned long cost[N];

//vector<unsigned long> c[N];
queue<unsigned short> q;
struct element{unsigned short n; unsigned long c;};
vector<element> v[N];
void bfs()
{
    unsigned int cur=q.front();
    q.pop();
    int dim=v[cur].size();
    for(size_t i=0;((i<dim) && (!viz[y]));i++)
    {
        int a=v[cur][i].n;
        int cst=v[cur][i].c;
        if(viz[a]) continue;
        q.push(a);
        viz[a]=true;
        if(a>cur)
            cost[a]=cost[cur]+cst;
        else
            cost[a]=cost[cur]-cst;
    }
}
inline int mod(int x)
{
    if(x>0) return x;
    return -x;
}
int main()
{
    unsigned short a,b;
    unsigned long d;
    fscanf(in,"%d %d %d %d\n",&n,&m,&x,&y);
    for(unsigned i=1;i<=m;i++)
    {
        fscanf(in,"%d %d %ul\n",&a,&b,&d);
        element nou;
        nou.c=d;
        nou.n=b;
        v[a].push_back(nou);
        nou.n=a;
        v[b].push_back(nou);
        //v[a].push_back(b);
        //c[a].push_back(d);
        //v[b].push_back(a);
        //c[b].push_back(d);
    }
    q.push(x);
    viz[x]=true;
    bfs();
    while((!q.empty())&&(!viz[y]))
        bfs();
    fprintf(out,"%d\n",mod(cost[x]-cost[y]));
    return 0;
}