#include <fstream>
#include <vector>
#include <queue>
#define MAX 30005
#define INF 1<<30

using namespace std;

struct nod{
    int nd, wt;
} dt;

vector<nod> v[MAX];
queue<int> q;
int n, m, x, y;
int d[MAX];

void read();
void bfs();
void write();

int main(){
    read();
    bfs();
    write();
    return 0;
}

void read(){
    ifstream fin ("sate.in");
    fin >> n >> m >> x >> y;
    int u, o, p;
    for (int i = 1; i <= n; ++i){
        fin >> u >> o >> p;
        dt.nd = o, dt.wt = p;
        v[u].push_back(dt);
        dt.nd = u, dt.wt = p;
        v[o].push_back(dt);
    }
    for (int i = 1; i <= n; ++i)
        d[i] = INF;
    d[x] = 0;
    fin.close();
}

void bfs(){
    q.push(x);

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

        for (unsigned int i = 0; i < v[k].size(); ++i)
            if (d[v[k][i].nd] > d[k] + (v[k][i].nd > k ? 1 : -1) * v[k][i].wt)
                d[v[k][i].nd] = d[k] + (v[k][i].nd > k ? 1 : -1) * v[k][i].wt,
                q.push(v[k][i].nd);
    }
}

void write(){
    ofstream fout ("sate.out");
    fout << d[y] << "\n";
    fout.close();
}