#include<cstdio>
#include<vector>
#include<queue>
#include<bitset>
#define infile "sate.in"
#define outfile "sate.out"
#define n_max 30005
#define pb push_back
#define mkp make_pair
#define INF 20000005
#define FOR(g,it) \
   for(vector< pair< int, int > > ::iterator it = g.begin(); it!=g.end(); ++it)
using namespace std;

vector < pair < int, int > >  v[n_max];

vector < int > d(n_max, INF);

int n, x0, x1;

void citeste()
{
	freopen(infile,"r",stdin);
	
	int m, x, y, c;
	
	scanf("%d %d %d %d",&n, &m, &x0, &x1);
	
	while(m--)
	{
		scanf("%d %d %d",&x,&y,&c);
		
		v[x].pb(mkp(y,c));
		v[y].pb(mkp(x,c));
	}
	
	fclose(stdin);
}

inline int ordine (int x, int y, int z)
{ return (x<=y && y<=z); }


int caz(int x, int p, int q)
{
	if(ordine(x,p,q) || ordine(q,p,x))
		return 1;
	if(ordine(x,q,p) || ordine(p,q,x))
		return 2;
	return 3;
}


void bfs()
{
	queue < int > q;
	
	q.push(x0);
	d[x0] = 0;
	
	while(!q.empty() && d[x1]==INF)
	{
		int x = q.front();
		q.pop();
		
		FOR(v[x],it)
			if(d[it->first]==INF)
			{
				switch ( caz(x0,x,it->first) )
				{
				case 1: d[it->first] = d[x] + it->second;  break;
			    case 2: d[it->first] = d[x] - it->second;  break;
			    case 3: d[it->first] = it->second - d[x];  break;
				}
				q.push(it->first);
			}
	}
}




void afiseaza()
{
	freopen(outfile,"w",stdout);

	printf("%d\n",d[x1]);
	
	fclose(stdout);
}


int main()
{
	citeste();
	bfs();
	afiseaza();
	
	return 0;
}