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

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;}

void C(int j)
{int k;
c[j]=1;
for(Nod *t=l[j];t;t=t->next)
if(!c[t->info])       
      {k=t->info;
      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));
      C(k);}}

int main()
{FILE *f=fopen("sate.in","r"),*g=fopen("sate.out","w");
fscanf(f,"%d%d%d%d",&n,&m,&x,&y),c[x]=1;
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)
if(!c[t->info])      
      {C(t->info);
      if(c[y])
             break;}
fprintf(g,"%d",B(x,y));
return 0;}