Zero the Path

You are given a tree with $N$ nodes with a number written on each node. A path-sum for any two nodes is defined as the sum of the values written at all nodes in the simple path between the two nodes. In particular if both the chosen nodes are same then path-sum is the value at the node itself. Find the maximum possible path-sum between any two nodes in the given tree if you can perform the follow