#include <bits/stdc++.h>
#define INF 999999999

using namespace std;

inline long long read()
{
	long long x = 0;
	int f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
	{
		if (ch == '-')
			f = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9')
	{
		x = (x << 1) + (x << 3) + (ch ^ 48);
		ch = getchar();
	}
	return x * f;
}
void write(const long long &x)
{
	if (!x)
	{
		putchar('0');
		return;
	}
	char f[100];
	long long tmp = x;
	if (tmp < 0)
	{
		tmp = -tmp;
		putchar('-');
	}
	long long s = 0;
	while (tmp > 0)
	{
		f[s++] = tmp % 10 + '0';
		tmp /= 10;
	}
	while (s > 0)
	{
		putchar(f[--s]);
	}
}

long long totN;
long long totM;
long long totS;
struct Edge
{
	int nxt;
	int to;
	long long val;
}edges[300090];
int head[300090];
int cnt_edges;
int pre[300090];
long long dis[300090];
bool vis[300090];
long long totANS;
int pres[300090];
void add_edges(int x,int y,long long w)
{
	++cnt_edges;
	edges[cnt_edges].nxt = head[x];
	head[x] = cnt_edges;
	edges[cnt_edges].to = y;
	edges[cnt_edges].val = w;
}
bool operator<(Edge a,Edge b)
{
	return a.val < b.val;
}
priority_queue<long long > Q;
void Dijstra()
{
	memset(dis, 0x3f, sizeof dis);
	dis[totS] = 0;
	Q.push(totS);
	while (!Q.empty())
	{
		long long nowX = Q.top();
		Q.pop();
		if (vis[nowX])
		{
			continue;
		}
		vis[nowX] = true;
		for (int i = head[nowX]; i; i = edges[i].nxt)
		{
			if (dis[edges[i].to] > dis[nowX] + edges[i].val)
			{
				pre[edges[i].to] = i;
				dis[edges[i].to] = dis[nowX] + edges[i].val;
				Q.push(edges[i].to);
			}
			if ((dis[edges[i].to] == dis[nowX] + edges[i].val) && (edges[i].val < edges[pre[edges[i].to]].val))
			{
				pre[edges[i].to] = i;
			}
		}
	}
}

int main()
{
	totN = read();
	totM = read();
	for (long long i = 1, x, y, w; i <= totM; ++i)
	{
		x = read();
		y = read();
		w = read();
		add_edges(x, y, w);
		add_edges(y, x, w);
	}
	totS = read();
	Dijstra();
	for (int i = 1; i <= totN; ++i)
	{
		totANS += edges[pre[i]].val;
	}
	write(totANS);
	putchar('\n');
	for (int i = 1; i <= totN; ++i)
	{
		if (i == totS)
		{
			continue;
		}
		write((pre[i] + 1) / 2);
		putchar(' ');
	}
	return 0;
} //Thomitics Code