Road Upgrade Distance Ledger

A transport analytics team stores the current shortest travel time between every pair of cities. New two-way roads are opened one by one. After each opening, the team needs the sum of the shortest travel times over all unordered city pairs. For every batch, process the road openings in order and report the sum after each one. Input Format: The first line contains t. Each case begins with n, followed by an n by n shortest-distance matrix. Then k follows, and each of the next k lines contains a, b, and w for a planned two-way road. Output Format: For every planned road, print the updated sum of shortest distances after that road is considered.