Hi, I made a graph problem that I couldn't solve and I was wondering if it's solvable at all, so I'd appreciate if someone solved it (doesn't have to be solvable in the given constraints just any solution).

given a rooted weighted tree made of n nodes you start from the root and go to any adjacent node you are given m resturants each one will be on a node you are required to print the minimum cost to visit k resturants (you can visit an edge more than once) $$$n \le 1e5$$$, m <= n, k <= m, cost <= 1e9