Meeting （完全图建图+最短路）

Bessie and her friend Elsie decide to have a meeting. However, after Farmer John decorated his fences
they were separated into different blocks. John’s farm are divided into n blocks labelled from 1 to n.
Bessie lives in the first block while Elsie lives in the n-th one. They have a map of the farm which shows
that it takes they ti minutes to travel from a block in Ei to another block in Ei where Ei (1 ≤ i ≤ m)
is a set of blocks. They want to know how soon they can meet each other and which block should be
chosen to have the meeting.
Input
The first line contains an integer T (1 ≤ T ≤ 6), the number of test cases. Then T test cases follow.
The first line of input contains n and m. 2 ≤ n ≤ 105
. The following m lines describe the sets
Ei (1 ≤ i ≤ m). Each line will contain two integers ti(1 ≤ ti ≤ 109
) and Si (Si > 0) firstly. Then Si
integer follows which are the labels of blocks in Ei
. It is guarant