Edges connect parent-child pairs. Store the weight of the edge from parent[v] to at node . Each child node stores exactly one edge weight. The root has no parent edge, so it has no edge weight. All other nodes store one edge weight each.
When you query a path from to , you process all edges on the path. By storing edge weights at child nodes, you can use the same HLD structure as for vertex queries.