#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
queue <int> q;
vector <int> a[30002];
vector <int> c[30002];
vector <int> d(30002,0);
int n,m,x,Y;

void read()
{
	freopen("sate.in","r",stdin);
	freopen("sate.out","w",stdout);
	scanf("%d%d%d%d",&n,&m,&x,&Y);
	int i,cost,cx,cy;
	for(i=1;i<=m;i++)
	{
		scanf("%d%d%d",&cx,&cy,&cost);
		a[cx].push_back(cy);
		a[cy].push_back(cx);
		c[cx].push_back(cost);
		c[cy].push_back(cost);
	}
}

void rez()
{
	int i,y,cost;
	q.push(x);
	while(!q.empty())
	{
		x=q.front();
		q.pop();
		for(i=0;i<a[x].size();i++)
		{
			y=a[x][i];
			if(d[y]==0)
			{
				cost=c[x][i];
				d[y]=(x<y ? d[x]+cost : d[x]-cost);
				q.push(y);
			}
		}
	}
	printf("%d\n",d[Y]);
}

int main()
{
	read();
	rez();
	return 0;
}