#include <stdio.h>
#include <vector>
#include <queue>
#define mp make_pair

using namespace std;

const int Nmax = 30005;

vector<pair<int, int> > A[Nmax];

void BFS (int x, int&n, vector<int>&d, queue<int>&Q)
{
    for (int i = 1; i <= n; i++)
        d[i] = -1;
    d[x] = 0;

    Q.push(x);

    while (!Q.empty())
    {
        int k = Q.front();
        Q.pop();

        for (auto i = 0; i < A[k].size(); i++)
        {
            int nod = A[k][i].first;
            int cost = A[k][i].second;

            if (d[nod] == -1)
            {
                if (nod > k)
                    d[nod] = d[k] + cost;
                else
                    d[nod] = d[k] - cost;
                Q.push(nod);
            }
        }
    }
}

int main()
{
    int n, m, start, finish;
    vector<int> d(Nmax);
    queue<int> Q;

    FILE *f = fopen("sate.in", "r");
    fscanf(f, "%d %d %d %d", &n, &m, &start, &finish);

    for (int i = 1; i <= m; i++)
    {
        int x, y, c;
        fscanf(f, "%d %d %d", &x, &y, &c);

        A[x].push_back(mp(y, c));
        A[y].push_back(mp(x, c));
    }

    fclose(f);
    BFS(start, n, d, Q);

    FILE *g = fopen("sate.out", "w");
    fprintf(g, "%d", d[finish]);
    fclose(g);

    return 0;
}