int vertex;

int weight;

Data() {};

Data(int vertex, int weight) : vertex(vertex), weight(weight) {};

bool operator<(const Data d) const {

return weight > d.weight; // ascending

}

for (int i = 1; i <= V; i++) {

dist[i] = INF;

}

dist[start] = 0;

pq.push(Data(start, 0)); // start vertex

while (!pq.empty()) {

Data u = pq.top();

pq.pop();

if (visited[u.vertex]) continue;

visited[u.vertex] = true;

for(Data v : edge[u.vertex]){

if(dist[v.vertex] > dist[u.vertex] + v.weight){

dist[v.vertex] = dist[u.vertex] + v.weight;

pq.push(Data(v.vertex, dist[v.vertex]));

}

}

}

ios::sync_with_stdio(false);

cin.tie(NULL);

cout.tie(NULL);

cin >> V >> E;

init();

/* input */

for (int i = 0; i < E; i++) {

cin >> u >> v >> w;

edge[u].push_back(Data(v, w));

//v[v].push_back(Data(u, w)); // bidirectional

}

int start;

cin >> start;

dijkstra(start);

/* output (1 to V) */

for (int i = 1; i <= V; i++) {

if(dist[i] == INF)

cout << "INF" << '\n';

else

cout << dist[i] << '\n';

}

}