#include<stdio.h>
#define MAX 10

int graph[MAX][MAX]={0};
int visited[MAX]={0};
int n;

void dfs(int v){
    visited[v]=1;
    printf("%d", v);
    for(int i=0; i<n; ++i){
        if(graph[v][i]&& !visited[i]){
            dfs(i);
        }
    }
}
int main(){
    int m;
    scanf("%d", &n);
    scanf("%d", &m);
    
    int u,v,w;
    for(int i=0; i<m; ++i);
    scanf("%d %d %d",&u, &v, &w);
    graph[u][v]=w;
}
int start;
scanf("%d", &start);
    printf("DFS Traversal starting from vertex %d: ",start);
    dfs(start);
    return 0;
}