#include<cstdio>
#define N 30001
typedef struct nod
{int info,cost;
struct nod *next;}Nod;
Nod *l[N],*t;
int i,n,m,x,y,j,p,u,k,s[N];

void A(int i,int j,int k)
{Nod *p=new Nod;
p->info=j,p->cost=k,p->next=l[i],l[i]=p;}

int B(int i,int j)
{for(Nod *p=l[i];p;p=p->next)
if(p->info==j)
      return p->cost;
return 0;}

int main()
{FILE *f=fopen("sate.in","r"),*g=fopen("sate.out","w");
fscanf(f,"%d%d%d%d",&n,&m,&x,&y);
while(m--)
      fscanf(f,"%d%d%d",&i,&j,&k),A(i,j,k),A(j,i,-k);
for(t=l[x];t;t=t->next)      
      s[u++]=t->info;
for(;p<u;p++)
      {if(B(x,y))
             break;
      j=s[p];
      for(t=l[j];t;t=t->next)
      if(!B(t->info,x)&&!B(x,t->info))       
             {k=t->info,s[u++]=k;
             if(x<j)
                    if(k<x)
                           A(k,x,B(k,j)-B(x,j));
                    else
                           A(x,k,B(j,k)+B(x,j));
             else
                    if(k<x)
                           A(k,x,B(j,x)+B(k,j));
                    else
                           A(x,k,B(j,k)-B(j,x));}}
fprintf(g,"%d",B(x,y));
return 0;}