#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 7, M = 2e6;
const long long mod = 1e9 + 7;
inline int read() {
  int ret = 0;
  char ch = getchar();
  bool f = 1;
  for (; !isdigit(ch); ch = getchar()) f ^= !(ch ^ '-');
  for (; isdigit(ch); ch = getchar()) ret = (ret << 1) + (ret << 3) + ch - 48;
  return f ? ret : -ret;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long ksm(long long a, long long b, long long mod) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return ans;
}
long long inv2(long long a, long long mod) { return ksm(a, mod - 2, mod); }
long long wei[M], dis[N], d[N];
bool vis[N];
int fa[N];
int head[N], NEXT[M], ver[M], tot;
void link(int u, int v, long long w) {
  ver[++tot] = v;
  NEXT[tot] = head[u];
  head[u] = tot;
  wei[tot] = w;
}
long long ans;
int cha(int x) {
  if (x == fa[x]) return x;
  return fa[x] = cha(fa[x]);
}
struct node {
  int u, v;
  long long w;
  int id;
} pre[N];
int n;
vector<int> qq;
void dij(int x) {
  for (int i = 1; i <= n; i++) {
    dis[i] = 1152921504606846976;
  }
  dis[x] = 0;
  pre[x].id = 0;
  priority_queue<pair<long long, int> > q;
  q.push(make_pair(0, x));
  while (!q.empty()) {
    x = q.top().second;
    q.pop();
    if (vis[x]) continue;
    vis[x] = true;
    if (pre[x].id != 0) {
      int xx = cha(pre[x].u);
      int yy = cha(pre[x].v);
      if (xx != yy) {
        qq.push_back(pre[x].id);
        ans += wei[pre[x].id * 2];
        fa[xx] = yy;
      }
    }
    for (int i = head[x]; i; i = NEXT[i]) {
      int y = ver[i];
      if (dis[y] > dis[x] + wei[i]) {
        dis[y] = dis[x] + wei[i];
        q.push(make_pair(-dis[y], y));
        pre[y].id = i / 2;
        pre[y].u = x;
        pre[y].v = y;
      } else if (dis[y] == dis[x] + wei[i]) {
        if (wei[pre[y].id * 2] > wei[i]) {
          pre[y].id = i / 2;
          pre[y].u = x;
          pre[y].v = y;
        }
      }
    }
  }
}
int main() {
  int m;
  int u, v;
  long long w;
  scanf("%d%d", &n, &m);
  tot = 1;
  ans = 0;
  for (int i = 1; i <= n; i++) fa[i] = i, d[i] = 1152921504606846976;
  for (int i = 1; i <= m; i++) {
    scanf("%d%d%lld", &u, &v, &w);
    link(u, v, w);
    link(v, u, w);
  }
  int inp;
  scanf("%d", &inp);
  dij(inp);
  printf("%lld\n", ans);
  for (int i = 0; i < qq.size(); i++) printf("%d ", qq[i]);
  return 0;
}
