#include<stdio.h>
#define MAX 10
int graph [MAX][MAX];
int visited [MAX];
int n;
void dfs(int i){
    visited[v][i];
    printf("%d ",v);
    for(int i=0;i<n;i++){
        if(graph[v][i]!= 0 && !visited[i]){
            dfs[v];
        }
    }
}
int main(){
    scanf("%d",&n);
    if(n<=0){
        printf("Invalid input");
        return 0;
    }
    int m;
    scanf("%d",&m);
    for(int i=0;i<n;i++){
        visited[i]=0;
        for(int j=0;j<m;j++){
            graph[i][j]=0;
        }
        int v,e,w;
        for(int i=0;i<=0;i++){
            scanf("%d %d %d",&v,&e,&w);
            graph[v][e]=w;
        }
        int start;
        scanf("%d",&start);
        printf("DFS Traversal starting from vertex %d",&start);
        dfs(start);
        
    }
}