#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
vector<vector<pair<long long, long long>>> g;
vector<vector<pair<long long, long long>>> par;
vector<long long> mindist;
long long n, m;
void dijkstra(long long source) {
  mindist.assign(n, (long long)1e15);
  mindist[source] = 0;
  priority_queue<pair<long long, long long>, vector<pair<long long, long long>>,
                 greater<pair<long long, long long>>>
      q;
  q.emplace(0, source);
  while (!q.empty()) {
    pair<long long, long long> p = q.top();
    q.pop();
    long long u = p.second, dist = p.first;
    if (mindist[u] < dist) continue;
    for (pair<long long, long long>& e : g[u]) {
      long long v = e.second, w = e.first;
      if (mindist[v] > dist + w) {
        par[v].clear();
        par[v].push_back({w, u});
        mindist[v] = dist + w;
        q.emplace(mindist[v], v);
      } else if (mindist[v] == dist + w) {
        par[v].push_back({w, u});
      }
    }
  }
}
map<pair<long long, long long>, long long> mp;
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m;
  g.assign(n, vector<pair<long long, long long>>());
  par.assign(n, vector<pair<long long, long long>>());
  for (long long i = 0; i < m; ++i) {
    long long u, v, w;
    cin >> u >> v >> w;
    u--, v--;
    mp[{min(u, v), max(u, v)}] = i + 1;
    g[u].push_back({w, v});
    g[v].push_back({w, u});
  }
  long long u;
  cin >> u;
  u--;
  dijkstra(u);
  long long ans = 0;
  set<long long> edg;
  for (long long j = 0; j < n; ++j) {
    sort((par[j]).begin(), (par[j]).end());
    if (j != u && par[j].size()) {
      ans += par[j][0].first;
      edg.insert(mp[{min(j, par[j][0].second), max(j, par[j][0].second)}]);
    }
  }
  cout << ans << "\n";
  for (long long e : edg) cout << e << " ";
}
