CP Graph - Tree Problems

This one is quite interesting;

• https://codeforces.com/problemset/problem/1675/F

And the problem is actually quite simple. Find the minimum travel distance that visits nodes a_i, …, a_k in no particular order, starting at node $x$ and ends at node $y$.

• Related: Euler Tour?

I struggled with this one for some reason:

• https://leetcode.com/problems/maximum-product-of-splitted-binary-tree/description/?envType=daily-question&envId=2026-01-07