//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 300005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iii pair<ii, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e10;
const int minf = -1e10;

int n, m;
struct edges{
    int u, v, w, id;
};
vector<iii> g[N];
edges e[N];
int capital;
int d[N];
int used[N];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n >> m;
    for(int i=1; i<=m; i++){
        int u, v, w;
        cin >> u >> v >> w;
        g[u].pb(iii(ii(v,w),i));
        g[v].pb(iii(ii(u,w),i));
        e[i].u = u; e[i].v = v; e[i].w = w; e[i].id = i;
    }
    cin >> capital;
}

void djk(){
    set<ii> q;
    for(int i=1; i<=n; i++) d[i] = inf;
    d[capital] = 0;
    q.insert({0,capital});
    while (q.size()){
        ii node = *q.begin();
        q.erase(q.begin());
        int u = node.se;
        if (d[u]!=node.fi) continue;
        //cout << u << ' ' << d[u] << endl;
        for(auto i : g[u]){
            int v = i.fi.fi;
            int uv = i.fi.se;
            int id = i.se;
            if (d[v] > d[u] + uv){
                d[v] = node.fi + uv;
                used[v] = id;
                q.insert({d[v],v});
            }
            else if (d[v] == d[u] + uv){
                if (e[used[v]].w > e[id].w) used[v] = id;
            }
        }
    }
}

void proc()
{
    djk();
    int ans = 0;
    for(int i=1; i<=n; i++){
        if (i!=capital){
            ans += e[used[i]].w;
        }
    }
    cout << ans << '\n';
    for(int i=1; i<=n; i++){
        if (i!=capital) cout << used[i] << ' ';
    }
}

signed main()
{
    readfile();
    proc();
    return 0;
}