i've read the tutorial for this problem over 30 times and looked at many codes and it still doesnt make sense , why are we using dsu ? how does adding an edge between node a and b with weight c determine all the values on the simple path from a to b ? ↵
↵
if somebody had solved it i would appreciate it if u write an explanation ↵
↵
[problem:https://mirror.codeforces.com/contest/1615/problem/1615D]
↵
if somebody had solved it i would appreciate it if u write an explanation ↵
↵
[problem: