import java.io.*;
import java.util.*;
public class P_4779 {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st ;
st = new StringTokenizer(br.readLine());
int n = Integer.parseInt(st.nextToken());
int m = Integer.parseInt(st.nextToken());
int s = Integer.parseInt(st.nextToken());
int result[] = new int[n+3];
boolean vis[] = new boolean[n+3];
List<Edge> list[]= new ArrayList[m +3];
Arrays.fill(result, Integer.MAX_VALUE);
Arrays.fill(vis, false);
for(int i = 1;i <= m; i++){
list[i] = new ArrayList<Edge>();
}
for(int i = 1;i <= m ;i ++){
st = new StringTokenizer(br.readLine());
int start = Integer.parseInt(st.nextToken());
int end = Integer.parseInt(st.nextToken());
int weight = Integer.parseInt(st.nextToken());
list[start].add(new Edge(end,weight));
}
PriorityQueue<Edge> pq = new PriorityQueue<Edge>();
result[s] = 0;
pq.add(new Edge(s,0));
while(!pq.isEmpty()){
Edge cur = pq.poll();
if(!vis[cur.index]){
vis[cur.index] = true;
for(int i = 0 ;i < list[cur.index].size();i++){
Edge next = list[cur.index].get(i);
if(result[next.index] > next.dis + result[cur.index]){
result[next.index] = next.dis + result[cur.index];
pq.add(new Edge(next.index,result[next.index]));
}
}
}
}
for(int i = 1;i <= n;i++){
System.out.print(result[i] +" ");
}
}
static class Edge implements Comparable<Edge>{
int index;
int dis ;
public Edge() {
super();
}
public Edge(int index, int dis) {
super();
this.index = index;
this.dis = dis;
}
public int compareTo(Edge o) {
return this.dis - o.dis;
}
}
}