Minimize pairwise connectivity after removal of a node

#	User	Rating
1	tourist	3803
2	jiangly	3707
3	Benq	3627
4	ecnerwala	3584
5	orzdevinwang	3573
6	Geothermal	3569
6	cnnfls_csy	3569
8	Radewoosh	3542
9	jqdai0815	3532
10	gyh20	3447

#	User	Contrib.
1	awoo	163
2	maomao90	160
3	adamant	159
4	maroonrk	152
5	-is-this-fft-	150
6	atcoder_official	148
6	SecondThread	148
8	nor	147
9	TheScrasse	146
10	Petr	144

Problem: You are given an undirected connected graph and a set of Q queries. Each query involves removing a vertex 'v' from the graph. After removing vertex 'v', the subtree of 'v's child is disconnected from the rest of the graph and is treated as a separate component. For each such component, calculate the value v(v-1)/2, where v is the count of vertices in that component.

The goal is to minimize the pairwise connectivity after removing each node. The pairwise connectivity is the sum of v(v-1)/2 for all components resulting from the removal of the node 'v'.

Input: A connected undirected graph with nodes (vertices) and edges. Q queries, each specifying a vertex 'v' to be removed.

Output: For each query, output the minimum pairwise connectivity after removing the specified vertex 'v' according to the rules defined above.

Constraints: The number of nodes (vertices) in the graph is less than or equal to 20^5. The number of queries is less than or equal to 20^5. Queries are independent of each other.

Example: Input: Graph: {1-2, 1-3, 2-4, 2-5, 3-6} Queries: Q1(1), Q2(2), Q3(3)

Output: After removing vertex 1: Pairwise connectivity = 4 After removing vertex 2: Pairwise connectivity = 4 After removing vertex 3: Pairwise connectivity = 2

Note: The provided example is for illustration purposes only and may not represent the actual solution to the problem. The actual solution depends on the specific structure of the given graph and queries.