write a go solution for D. Non Prime Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a tree with n vertices.You need to construct an array a_1,a_2,ldots,a_n of length n, consisting of unique integers from 1 to 2*n, and such that for each edge u_iarrowv_i of the tree, the value |a_u_i-a_v_i| is not a prime number.Find any array that satisfies these conditions, or report that there is no such array.InputEach test contains multiple test cases. The first line contains the number of test cases t (1<=t<=10^4). The description of the test cases follows.The first line of each test case contains a single integer n (2<=n<=2*10^5) — the number of vertices in the tree.The next n-1 lines contain the edges of the tree, one edge per line. The i-th line contains two integers u_i and v_i (1<=u_i,v_i<=n; u_ineqv_i), denoting the edge between the nodes u_i and v_i.It's guaranteed that the given edges form a tree.It is guaranteed that the sum of n over all test cases does not exceed 2*10^5.OutputFor each test case, if an array that satisfies the conditions exists, print its elements a_1,a_2,ldots,a_n. Otherwise, print -1.ExampleInput251 22 32 43 571 21 32 43 53 63 7Output2 10 1 6 5 
8 7 12 1 4 6 3 
NoteThe possible answers are shown below. Instead of the vertex numbers, the corresponding elements of the array a are written in them. The image of the tree in the first test case   The image of the tree in the second test case. Output only the code with no comments, explanation, or additional text.