Conservative Graph

You are given a graph with $N$ nodes and $M$ edges. Each edge has a value associated with it. There are no self-loops and multiple edges in the graph. Each edge connects two nodes. The cost of going from the first node of the edge to the second via the edge is equal to the value of the edge whereas the cost of going in the reverse direction is equal to the negative of it. Your task is to fi