Leetcode 3313. Find the Last Marked Nodes in Tree

Given a tree and a marking process (e.g., initial marked nodes or rules for mark propagation along edges), determine which nodes become marked last; the core challenge is computing arrival times on a tree efficiently (multi-source BFS/Dijkstra or tree DP) and returning the nodes with maximum mark time.