import java.io.*;
import java.util.*;

public class MWGPathfinder
{
	static int vertices,edges,vend;
	static ArrayList[] adjlist;
	static double distance[];
	static int reps = 10000;
	
	public static void main(String args[]) throws IOException
	{	
		BufferedReader f = new BufferedReader(new FileReader("dv.in"));
		StringTokenizer st = new StringTokenizer(f.readLine());
		vertices = Integer.parseInt(st.nextToken());
		edges = Integer.parseInt(st.nextToken());
		vend = Integer.parseInt(st.nextToken());
		adjlist = new ArrayList[vertices];
		for(int n=0; n<vertices; n++) adjlist[n] = new ArrayList();
		for(int n=0; n<edges; n++)
		{
			st = new StringTokenizer(f.readLine());
			int v1 = Integer.parseInt(st.nextToken());
			int v2 = Integer.parseInt(st.nextToken());
			int w = Integer.parseInt(st.nextToken());
			Edge e = new Edge(v1,v2,w);
			adjlist[v1].add(e);
			adjlist[v2].add(e);	
		}
		
		distance = new double[vertices];
		for(int n=0; n<vertices; n++) distance[n] = 0;
		for(int n=0; n<reps; n++) update();
		for(int n=0; n<vertices; n++) System.out.print(distance[n]+"  ");
		System.out.println();
		
		System.exit(0);
	}
	
	public static void update()
	{
		double newdist[] = new double[vertices];
		for(int n=0; n<vertices; n++) newdist[n] = 0;
		for(int n=0; n<vertices; n++)
		{
			int degree = adjlist[n].size();
			double t = 1+distance[n];
			newdist[n]+=Math.pow(t,-(double)4);
			for(int a=0; a<degree; a++)
			{
				t = 1+distance[((Edge)adjlist[n].get(a)).getVertex(n)];
				newdist[n]+=Math.pow(t,-(double)4);
			}
		}
		for(int n=0; n<vertices; n++) distance[n] = Math.pow(newdist[n],-(double)1/4);
		distance[vend]=0;
	}
}

class Edge
{
	int v1;
	int v2;
	double w;
	public Edge(int vertex1, int vertex2, double weight)
	{
		v1=vertex1; v2=vertex2; w=weight;
	}
	public double getWeight()
	{
		return w;
	}
	public int getVertex(int a)
	{
		if(a==v1) return v2;
		if(a==v2) return v1;
		return Math.min(v1,v2);
	}
}



// distance = 1/(sqrt(x)+sqrt(y))^2;