You handled edge queries by storing edge weights at child nodes. This maps edge queries to vertex queries with a small adjustment at the LCA. The LCA exclusion rule ensures you only query edges on the path, not the vertex above the path.
For edge queries, do not include the LCA in the final segment. HLD works for both vertex and edge queries with minimal changes. The decomposition structure is the same, only the query range adjustment differs.