#include<bits/stdc++.h>
#define maxn 30005
using namespace std;

ifstream fin("sate.in");
ofstream fout("sate.out");

int n,m,x,y;
int d[maxn],viz[maxn];
vector <pair<int,int> > lista[maxn];
queue <int> q;

void citire()
{
    fin>>n>>m>>x>>y;
    int a,b,c;
    for(int i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        lista[a].push_back({b,c});
        lista[b].push_back({a,c});
    }
}

void bfs(int node)
{
    q.push(node);
    viz[node]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(auto x:lista[nod])
        {
            int vecin=x.first;
            int cost=x.second;
            if(!viz[vecin])
            {
                viz[vecin]=1;
                q.push(vecin);
                if(vecin>nod)
                    d[vecin]=d[nod]+cost;
                else
                    d[vecin]=d[nod]-cost;
                if(vecin==y)
                {
                    fout << d[y];
                    return;
                }
            }
        }
    }
}

int main()
{
    citire();
    bfs(x);
    return 0;
}