#include<bits/stdc++.h>

using namespace std;

void in(int &x){

    register char c=getchar();x=;int f=;

    while(!isdigit(c)){if(c=='-') f=-;c=getchar();}

    while(isdigit(c)){x=x*+c-'';c=getchar();}

    x*=f;

}

int c,p,p_b,pa_1,pa_2,head[],vis[],d[],tot,ans;

struct node{

    int to,dis,pre;

}e[];

void add(int u,int v,int w){

    e[++tot].to=v;e[tot].pre=head[u];head[u]=tot;e[tot].dis=w;

}

struct npde{

    int to,dis;

    bool operator < (const npde &x) const{

        return dis>x.dis;

    }

};

priority_queue<npde>Q;

void spfa(int s){

    while(!Q.empty()) Q.pop();

    memset(vis,,sizeof(vis));memset(d,0x7f,sizeof(d));

    d[s]=;Q.push((npde){s,});

    while(!Q.empty()){

        int u=Q.top().to;Q.pop();

        if(vis[u]) continue;

        vis[u]=;

        for(int i=head[u],v;v=e[i].to,i;i=e[i].pre){

            if(d[v]>d[u]+e[i].dis){

                d[v]=d[u]+e[i].dis;

                Q.push((npde){v,d[v]});

            }

        }

    }

}

int main()

{

    in(c),in(p),in(p_b),in(pa_1),in(pa_2);

    for(int i=;i<=c;i++){

        int u,v,w;

        in(u),in(v),in(w);

        add(u,v,w);add(v,u,w);

    }spfa(p_b);

    if(d[pa_1]<d[pa_2])ans+=d[pa_1],spfa(pa_1),ans+=d[pa_2];

    else ans+=d[pa_2],spfa(pa_2),ans+=d[pa_1];

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

    return ;

}