complete the problem in python

Name: Implementation of Depth-First Search (DFS) to solve the least cost path in a weighted tree In this problem, you will be given an undirected weighted graph that will represent a weighted tree. So, there will be no cycles. You will also be given a root node. You need to find a path that gives the least cost among all the paths from the root to the leaf nodes. Here cost denotes the summation of the weight of the edges of a particular path. While traversing the path, you will not visit the same node twice. In the first line, you will be given two integer numbers N and E denoting the number of nodes and the number of edges in the tree respectively. In the following E lines, you will have three integer values U,V, and W denoting there is an undirected edge between U and V having weight W. As output, in the first line, you will print the minimum cost that is observed among all the paths from the root to the leaf nodes. In the following line, you will print the path in reverse order from the desired leaf to the root node that provides the least path. There are some additional strings to be printed such as "Min Cost: " and "Path : " for the clarification. Please look at the Test Cases section for the details. Limits 1