// editor2
#include<stdio.h>

void DFS(int sour,int **mat,int *visited,int V){
    printf("%d ",sour);
    visited[sour] = 1;
    for(int i=0;i<V;i++){
        if(mat[sour][i]!=0&&visited[i]==0)
        DFS(i,mat,visited,V);
    }
}
void enqueue(int num){
    queue[++rear] = num;
}

int dequeue(){
    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 ",t)
    }
}

int main(){
    int V,E,r,c,itr,u,v,w,sour;
    scanf("%d",&V);
    if(V<0){
        printf("")
    }
    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));
    printf("DFS traversal starting from vertex 0:");
    BFS(sour,mat,visited,V);
}