#include <cstdio>
#include <algorithm>
#include <queue>

using namespace std;

#define FIN "sate.in"
#define FOUT "sate.out"

#define N 30010
#define MAX 60

int m, d;
short int x, y, n;

vector < pair <short int, int> > v[N];
vector <short int> p[N];

void read()
{
    int i, j, a, b, c, nr;
	char s[MAX];

    freopen(FIN, "r", stdin);

    scanf("%hd%d", &n, &m);
    scanf("%hd%hd\n", &a, &b);

    x = min(a, b);
    y = max(a, b);

    for (i = 1, nr = 0; i <= m; ++ i)
    {
        gets(s);

		a = b = c = 0;

        for (j = 0; s[j] != ' '; ++ j)
            a = a * 10 + (s[j] - '0');

        for (j = j + 1; s[j] != ' '; ++ j)
            b = b * 10 + (s[j] - '0');

        for (j = j + 1; s[j] && s[j] != 13; ++ j)
            c = c * 10 + (s[j] - '0');

		v[a].push_back(make_pair(b, c));
        p[b].push_back(v[a].size() - 1);

        v[b].push_back(make_pair(a, c));
        p[a].push_back(v[b].size() - 1);

		scanf("\n");
    }
}

int mod(int a)
{
    return a > 0 ? a : -a;
}

void DFS(short int a, int d1)
{
    short int i, k;
	int d2;

    if (a == y)
        d = d1;

    for (i = 0; i < v[a].size(); ++i)
        if (v[a][i].first)
        {
            if ((x <= a && a < v[a][i].first) || (x >= a && a > v[a][i].first))
                d2 = d1 + v[a][i].second;
            else
                d2 = mod(d1 - v[a][i].second);

            k = v[a][i].first;
            v[a][i].first = 0;
            v[k][p[a][i]].first = 0;

            DFS(k, d2);
        }

    return;
}

int main()
{
    freopen(FOUT, "w", stdout);

    read();

    DFS(x, 0);

    printf("%d\n", d);
}