Problem: Note that the only difference between the easy and hard version is the constraint on the number of queries. You can make hacks only if all versions of the problem are solved.

This is an interactive problem.

You are given a tree consisting of n nodes numbered with integers from 1 to n. Ayush and Ashish chose two secret distinct nodes in the tree. You need to find out both the nodes. You can make the following query: 

  * Provide a list of nodes and you will receive a node from that list whose sum of distances to both the hidden nodes is minimal (if there are multiple such nodes in the list, you will receive any one of them). You will also get the sum of distances of that node to the hidden nodes. 



Recall that a tree is a connected graph without cycles. The distance between two nodes is defined as the number of edges in the simple path between them.

More formally, let's define two hidden nodes as s and f. In one query you can provide the set of nodes \\{a_1, a_2, …, a_c\} of the tree. As a result, you will get two numbers a_i and dist(a_i, s) + dist(a_i, f). The node a_i is any node from the provided set, for which the number dist(a_i, s) + dist(a_i, f) is minimal.

You can ask no more than 14 queries.

Input

The first line contains a single integer t (1 ≤ t ≤ 10) — the number of test cases. Please note, how the interaction process is organized.

The first line of each test case consists of a single integer n (2 ≤ n ≤ 1000) — the number of nodes in the tree.

The next n - 1 lines consist of two integers u, v (1 ≤ u, v ≤ n, u ≠ v) — the edges of the tree.

Interaction

To ask a query print a single line: 

  * In the beginning print "? c " (without quotes) where c (1 ≤ c ≤ n) denotes the number of nodes being queried, followed by c distinct integers in the range [1, n] — the indices of nodes from the list. 



For each query, you will receive two integers x, d — the node (among the queried nodes) with the minimum sum of distances to the hidden nodes and the sum of distances from that node to the hidden nodes. If the subset of nodes queried is invalid or you exceeded the number of queries then you will get x = d = -1. In this case, you should terminate the program immediately.

When you have guessed the hidden nodes, print a single line "! " (without quotes), followed by two integers in the range [1, n] — the hidden nodes. You can output the hidden nodes in any order.

After this, you should read a string. If you guess the nodes correctly, you will receive the string "Correct". In this case, you should continue solving the remaining test cases or terminate the program, if all test cases were solved. Otherwise, you will receive the string "Incorrect". In this case, you should terminate the program immediately.

Guessing the hidden nodes does not count towards the number of queries asked.

The interactor is not adaptive. The hidden nodes do not change with queries.

Do not forget to read the string "Correct" / "Incorrect" after guessing the hidden nodes.

You need to solve each test case before receiving the input for the next test case.

The limit of 14 queries applies to each test case and not to the entire input.

After printing a query do not forget to output the end of the line and flush the output. Otherwise, you will get Idleness limit exceeded. To do this, use:

  * fflush(stdout) or cout.flush() in C++;
  * System.out.flush() in Java;
  * flush(output) in Pascal;
  * stdout.flush() in Python;
  * see the documentation for other languages.



Hacks

To hack the solution, use the following test format:

The first line should contain a single integer t (1 ≤ t ≤ 10) — the number of test cases. The description of the test cases follows.

The first line of each test case should contain a single integer n (2 ≤ n ≤ 1000) — the number of nodes in the tree. The second line should contain two distinct integers in the range [1, n] — the hidden nodes. The next n - 1 lines should contain two integers u, v (1 ≤ u, v ≤ n, u ≠ v) — the edges of the tree.

Example

Input


1
3
1 2
1 3

1 1

2 3

3 1

3 1

Correct

Output


? 1 1

? 1 2

? 1 3

? 2 2 3

! 1 3

Note

The tree from the first test is shown below, and the hidden nodes are 1 and 3.

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long binary_search(function<bool(long long)> func, long long start,
                        long long end) {
  if (end <= start) {
    return end;
  }
  if (!func(end - 1)) {
    return end;
  }
  while (end - start > 1) {
    long long mid = (start + end) / 2;
    if (func(mid)) {
      end = mid;
    } else {
      start = mid;
    }
  }
  if (func(start)) {
    return start;
  } else {
    return end;
  }
};
template <class T>
class depth_first_search_iterator {
 public:
  stack<pair<T, T>> todo;
  function<bool(T)> notvisited;
  function<void(T)> mark_visited;
  function<set<T>(T)> neighbors;
  depth_first_search_iterator() {}
  depth_first_search_iterator(T start, function<bool(T)> notv,
                              function<void(T)> mark_v,
                              function<set<T>(T)> neigh)
      : notvisited(notv),
        mark_visited(mark_v),
        neighbors(neigh),
        end_(false),
        current(start),
        prev(start) {
    todo.push(make_pair(start, start));
    operator++();
  }
  void operator++() {
    end_ = true;
    while (!todo.empty()) {
      current = todo.top().first;
      prev = todo.top().second;
      todo.pop();
      if (notvisited(current)) {
        mark_visited(current);
        for (const T x : neighbors(current)) {
          todo.push(make_pair(x, current));
        }
        end_ = false;
        break;
      }
    }
  }
  T operator*() { return current; }
  T previous() { return prev; }
  bool end() { return end_; }

 private:
  T current;
  T prev;
  bool end_;
};
template <class T>
class breadth_first_search_iterator {
 public:
  queue<pair<T, T>> todo;
  function<bool(T)> notvisited;
  function<void(T)> mark_visited;
  function<set<T>(T)> neighbors;
  breadth_first_search_iterator() {}
  breadth_first_search_iterator(T start, function<bool(T)> notv,
                                function<void(T)> mark_v,
                                function<set<T>(T)> neigh)
      : notvisited(notv),
        mark_visited(mark_v),
        neighbors(neigh),
        end_(false),
        current(start),
        prev(start) {
    todo.push(make_pair(start, start));
    operator++();
  }
  void operator++() {
    end_ = true;
    while (!todo.empty()) {
      current = todo.front().first;
      prev = todo.front().second;
      todo.pop();
      if (notvisited(current)) {
        mark_visited(current);
        for (const T x : neighbors(current)) {
          todo.push(make_pair(x, current));
        }
        end_ = false;
        break;
      }
    }
  }
  T operator*() { return current; }
  T previous() { return prev; }
  bool end() { return end_; }

 private:
  T current;
  T prev;
  bool end_;
};
template <class T>
class Graph {
 public:
  vector<T> vertices;
  vector<set<int>> neighbors;
  depth_first_search_iterator<int> dfs_iterator;
  breadth_first_search_iterator<int> bfs_iterator;
  vector<bool> visited;
  Graph() {}
  Graph(int n) {
    for (int i = 0; i < n; ++i) {
      AddVertex(0);
    }
  }
  void AddVertex(T val) {
    vertices.push_back(val);
    neighbors.push_back(set<int>());
  }
  bool EdgeExists(int i, int j) {
    return (neighbors[i].find(j) != neighbors[i].end());
  }
  void AddEdge(int i, int j) {
    if (!EdgeExists(i, j)) {
      neighbors[i].insert(j);
      if (i != j) {
        neighbors[j].insert(i);
      }
    }
  }
  T& operator[](int i) { return vertices[i]; }
  void RemoveEdge(int i, int j) {
    if (EdgeExists(i, j)) {
      neighbors[i].erase(find(neighbors[i].begin(), neighbors[i].end(), j));
      neighbors[j].erase(find(neighbors[j].begin(), neighbors[j].end(), i));
    }
  }
  void dfs_init(int start) {
    visited = vector<bool>(vertices.size(), false);
    dfs_iterator = depth_first_search_iterator<int>(
        start, [this](int x) { return !visited[x]; },
        [this](int x) { visited[x] = true; },
        [this](int x) { return neighbors[x]; });
  }
  void bfs_init(int start) {
    visited = vector<bool>(vertices.size(), false);
    bfs_iterator = breadth_first_search_iterator<int>(
        start, [this](int x) { return !visited[x]; },
        [this](int x) { visited[x] = true; },
        [this](int x) { return neighbors[x]; });
  }
  void print_() {
    for (int i = (0); i < (0) + (vertices.size()); ++i) {
      for (auto x : neighbors[i]) {
        if (i <= x) {
          cout << i << "-" << x << endl;
        }
      }
    }
  }
};
template <class T>
pair<vector<T>, vector<int>> DijkstraUndirected(int N_vertices,
                                                map<pair<int, int>, T>& edges,
                                                int s, T infinity) {
  vector<T> dist(N_vertices, infinity);
  dist[s] = 0;
  vector<int> prev(N_vertices);
  set<pair<T, int>> Q;
  for (int i = 0; i < N_vertices; ++i) {
    Q.insert(make_pair(dist[i], i));
  }
  Graph<int> g(N_vertices);
  for (auto x : edges) {
    g.AddEdge(x.first.first, x.first.second);
  }
  while (!Q.empty()) {
    int u = Q.begin()->second;
    Q.erase(Q.begin());
    for (int v : g.neighbors[u]) {
      T one_way = 0, other_way = 0;
      if (edges.find(make_pair(u, v)) != edges.end()) {
        one_way = edges[make_pair(u, v)];
      }
      if (edges.find(make_pair(v, u)) != edges.end()) {
        other_way = edges[make_pair(v, u)];
      }
      T alt = dist[u] + one_way + other_way;
      if (alt < dist[v]) {
        prev[v] = u;
        Q.erase(make_pair(dist[v], v));
        dist[v] = alt;
        Q.insert(make_pair(dist[v], v));
      }
    }
  }
  return make_pair(dist, prev);
};
template <class T>
pair<vector<int>, vector<int>> DijkstraUndirectedGraph(Graph<T>& g, int s,
                                                       int infinity = -1) {
  map<pair<int, int>, int> edges;
  int count = 0;
  for (int i = 0; i < g.vertices.size(); ++i) {
    for (auto w : g.neighbors[i]) {
      if ((edges.find(make_pair(i, w)) == edges.end()) &&
          (edges.find(make_pair(w, i)) == edges.end())) {
        edges[make_pair(i, w)] = 1;
      }
      ++count;
    }
  }
  if (infinity == -1) {
    return DijkstraUndirected<int>(g.vertices.size(), edges, s, count + 1);
  } else {
    return DijkstraUndirected<int>(g.vertices.size(), edges, s, infinity);
  }
};
int main() {
  cout.precision(17);
  long long modd = 1000 * 1000 * 1000 + 7;
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  uniform_int_distribution<int> rand_gen(0, modd);
  long long infinit = 10000000000000000;
  int test_cases;
  cin >> test_cases;
  for (int t = (1); t < (1) + (test_cases); ++t) {
    int n;
    cin >> n;
    Graph<int> g(n);
    for (int i = (0); i < (0) + (n - 1); ++i) {
      int aa;
      cin >> aa;
      int bb;
      cin >> bb;
      g.AddEdge(aa - 1, bb - 1);
    }
    cout << "? " << n;
    for (int i = (1); i < (1) + (n); ++i) {
      cout << " " << i;
    }
    cout << endl;
    int node_on_path;
    cin >> node_on_path;
    int dist_to_ends;
    cin >> dist_to_ends;
    auto q = DijkstraUndirectedGraph(g, node_on_path - 1).first;
    map<int, vector<int>> circle;
    for (int i = (0); i < (0) + (q.size()); ++i) {
      circle[q[i]].push_back(i);
    }
    int dist_to_far_end = binary_search(
                              [&circle, &dist_to_ends](long long x) {
                                if (circle[x].empty()) {
                                  return true;
                                }
                                cout << "? " << circle[x].size();
                                for (auto x : circle[x]) {
                                  cout << " " << x + 1;
                                }
                                cout << endl;
                                int pt;
                                cin >> pt;
                                int val;
                                cin >> val;
                                return (val > dist_to_ends);
                              },
                              0, 1003) -
                          1;
    cout << "? " << circle[dist_to_far_end].size();
    for (auto x : circle[dist_to_far_end]) {
      cout << " " << x + 1;
    }
    cout << endl;
    int pt1;
    cin >> pt1;
    int val;
    cin >> val;
    auto w = DijkstraUndirectedGraph(g, pt1 - 1).first;
    vector<int> final_circle;
    for (int i = (0); i < (0) + (w.size()); ++i) {
      if (w[i] == dist_to_ends) {
        final_circle.push_back(i);
      }
    }
    cout << "? " << final_circle.size();
    for (auto x : final_circle) {
      cout << " " << x + 1;
    }
    cout << endl;
    int pt2;
    cin >> pt2;
    int val2;
    cin >> val2;
    cout << "! " << pt1 << " " << pt2 << endl;
    string s;
    cin >> s;
  }
  return 0;
}