#include<stdio.h>
#include<stdlib.h>

int*queue;
int front =0,rear=-1;

void enQueue(int num){
    queue[++rear]=num;
}
int deQueue(int num){
    return queue[front++];
}
void BFS(int sour,int **mat,int *visited,int v){
    enQueue(sour);
    visited[sour]=1;
    while(front <= rear){
        int temp = deQueue();
        printf("%d",temp);
        for(int i=0;i<V;i++){
            if(mat[temp][i]!=0 && visited[i]==0){
                enQueue(i);
                visited[i] =1;
            }
        }
    }
}
int main(){
    int V,E,r,c,itr,u,v,w,sour;
    scanf("%d",&V);
    scanf("%d",&E);
    int **mat;
    int *visited;
    mat = (int**)malloc(V * sizeof(int*));
    for(r=0;r<V;r++)
        mat[r] = (int*)malloc(V * sizeof(int));
    for(itr=1;itr<=E;itr++)
        scanf("%d%d%d",&u,&v,&w);
        mat[u][v]= w;
    }
    scanf("%d",&sour);
    visited=(int*)malloc(V * sizeof(int));
    queue = (int*)malloc(V * sizeof(int));
    BFS(sour,mat,visited,V);
    return 0;
    
    
}