Function

vector< vector< int > > List;
vector< int > Tmp;

void DFS(int u) {
    Tmp.push_back(u);

    bool isLeaf = true;
    for(auto v : Tree[u]){
        isLeaf = false;
        DFS(v);
    }

    if( isLeaf ) List.push_back( Tmp );
    Tmp.pop_back();
}