#include<bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define int long long

using namespace std;

void fileIO()
{
    freopen("city.in", "r", stdin);
    freopen("city.out", "w", stdout);
}
void fastIO()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

mt19937 mt(666);

const int MAXN=300005;
const int MAXM=310005;

int n,m;
int s,t;
pair<pair<int,int>,int> edges[MAXM];
int par[MAXN];
int depth[MAXN];
long long sum=0;
long long ans=(long long)1e18;

int getRoot(int v)
{
    if(v==par[v]) return v;
    return par[v]=getRoot(par[v]);
}

void unite(int u,int v)
{
    if(u==v) return;
    if(depth[u]<depth[v]) swap(u,v);
    par[v]=u;
    if(depth[u]==depth[v]) depth[u]++;
}

bool cmp(pair<pair<int,int>,int> a, pair<pair<int,int>,int> b)
{
    return a.se>b.se;
}

pair<pair<int,int>,int> copy1[MAXM];
void calc(int tt)
{
    for(int i=1;i<=m;i++) copy1[i]=edges[i];
    if(tt>0)
    {
    for(int i=0;i<m/28;i++)
    {
        int ind1=mt()%m+1;
        int ind2=ind1;
        while(ind2==ind1) ind2=mt()%m+1;
        swap(edges[ind1], edges[ind2]);
    }
    }

    for(int i=1;i<=n;i++)
    {
        par[i]=i;
        depth[i]=1;
    }

    long long weight=0;
    for(int i=1;i<=m;i++)
    {
        int u=edges[i].fi.fi;
        int v=edges[i].fi.se;
        int w=edges[i].se;
        int ru=getRoot(u);
        int rv=getRoot(v);
        int rs=getRoot(s);
        int rt=getRoot(t);
        if(ru==rs && rv==rt) continue;
        if(ru==rt && rv==rs) continue;
        unite(ru,rv);
        weight+=w;
    }

    if(sum-weight<ans)
    {
        ans=sum-weight;
    }
    else
    {
        for(int i=1;i<=m;i++) edges[i]=copy1[i];
    }
}

void solve()
{
    cin>>n>>m;
    cin>>s>>t;
    for(int i=1;i<=m;i++)
    {
        cin>>edges[i].fi.fi>>edges[i].fi.se>>edges[i].se;
        sum+=edges[i].se;
    }

    sort(edges+1,edges+m+1,cmp);
    for(int i=0;i<42;i++)
    {
        calc(i);
    }

    cout<<ans<<endl;

    return;
}

signed main()
{
    fastIO();
    fileIO();

    solve();

    return 0;
}