Program in C++ only 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...

Program in C++

Extracted text: Program in C++ only 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 figure out if the graph is conservative or not. The cost of a path is simply the sum of the costs of each edge in the path. For each testcase, output yes if the graph is conservative otherwise no Note: Pass the below input together as one Input: 1 44 122 232 142 431 Output: no