#include <bits/stdc++.h>

using namespace std;

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

const int nmax=3e4+5;

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

int n, m, x, y, d[nmax];

void dfs (int nod)
{
    for (auto it:v[nod])
    {
        if (!d[it.first])
        {
            d[it.first]=d[nod]+it.second;
            dfs(it.first);
        }
    }
}

signed main()
{
    fin >> n >> m >> x >> y;
    for (int i=1; i<=m; i++)
    {
        int a, b, c;
        fin >> a >> b >> c;
        if (b<a)
            swap(a,b);
        v[a].push_back({b,c});
        v[b].push_back({a,-c});
    }
    d[x]=1;
    dfs(x);
    fout << d[y]-1;
    return 0;
}