Nastia has an unweighted tree with n vertices and wants to play with it!

The girl will perform the following operation with her tree, as long as she needs:

  1. Remove any existing edge. 
  2. Add an edge between any pair of vertices. 



What is the minimum number of operations Nastia needs to get a bamboo from a tree? A bamboo is a tree in which no node has a degree greater than 2.

Input

The first line contains a single integer t (1 ≤ t ≤ 10 000) — the number of test cases.

The first line of each test case contains a single integer n (2 ≤ n ≤ 10^5) — the number of vertices in the tree.

Next n - 1 lines of each test cases describe the edges of the tree in form a_i, b_i (1 ≤ a_i, b_i ≤ n, a_i ≠ b_i).

It's guaranteed the given graph is a tree and the sum of n in one test doesn't exceed 2 ⋅ 10^5.

Output

For each test case in the first line print a single integer k — the minimum number of operations required to obtain a bamboo from the initial tree.

In the next k lines print 4 integers x_1, y_1, x_2, y_2 (1 ≤ x_1, y_1, x_2, y_{2} ≤ n, x_1 ≠ y_1, x_2 ≠ y_2) — this way you remove the edge (x_1, y_1) and add an undirected edge (x_2, y_2).

Note that the edge (x_1, y_1) must be present in the graph at the moment of removing.

Example

Input


2
7
1 2
1 3
2 4
2 5
3 6
3 7
4
1 2
1 3
3 4


Output


2
2 5 6 7
3 6 4 5
0

Note

Note the graph can be unconnected after a certain operation.

Consider the first test case of the example: 

<image> The red edges are removed, and the green ones are added.
// #pragma GCC optimize(2)
// #pragma GCC optimize("Ofast","inline","-ffast-math")
// #pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<iostream>
#include<cstdio>
#include<string>
#include<ctime>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<stack>
#include<climits>
#include<queue>
#include<map>
#include<set>
#include<sstream>
#include<cassert>
#include<bitset>
#include<list>
#include<unordered_map>
#define lowbit(x) x&-x
using namespace std;
typedef long long LL;
typedef unsigned long long ull;
template<typename T>
inline void read(T &x)
{
	T f=1;x=0;
	char ch=getchar();
	while(0==isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
	while(0!=isdigit(ch)) x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
	x*=f;
}
template<typename T>
inline void write(T x)
{
	if(x<0){x=~(x-1);putchar('-');}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const int inf=0x3f3f3f3f;
const int N=1e6+100;
vector<pair<int,int>>node[N];
bool del_fa[N],vis[N],ban[N];
vector<pair<int,int>>del,add;
vector<pair<int,int>>leaf;
vector<int>temp_leaf;
int answer=0;
void dfs1(int u,int fa) {
	int son=0;
	for(auto it:node[u]) {
		int v=it.first;
		int id=it.second;
		if(v==fa) {
			continue;
		}
		dfs1(v,u);
		if(del_fa[v]) {
			ban[id]=true;
		} else {
			son++;
		}
	}
	if(son>=2) {
		del_fa[u]=true;
		for(auto it:node[u]) {
			int v=it.first;
			int id=it.second;
			if(v==fa) {
				continue;
			}
			if(son<=2) {
				break;
			}
			if(!del_fa[v]) {
				son--;
				ban[id]=true;
			}
		}
	}
}
void dfs2(int u,int fa) {
	int son=0;
	vis[u]=true;
	for(auto it:node[u]) {
		int v=it.first;
		int id=it.second;
		if(v==fa) {
			continue;
		}
		if(ban[id]) {
			continue;
		}
		dfs2(v,u);
		son++;
	}
	if(fa==-1&&son==1) {
		temp_leaf.push_back(u);
	} else if(son==0) {
		temp_leaf.push_back(u);
	}
}
void init(int n) {
	memset(vis,false,(n+5));
	memset(ban,false,(n+5));
	memset(del_fa,false,(n+5));
	leaf.clear();
	add.clear();
	del.clear();
	for(int i=1;i<=n;i++) {
		node[i].clear();
	}
}
int main()
{
#ifndef ONLINE_JUDGE
//  freopen("data.in.txt","r",stdin);
//  freopen("data.out.txt","w",stdout);
#endif
//  ios::sync_with_stdio(false);
	int w;
	cin>>w;
	while(w--) {
		int n;
		read(n);
		init(n);
		for(int i=1;i<n;i++) {
			int u,v;
			read(u),read(v);
			node[u].push_back({v,i});
			node[v].push_back({u,i});
		}
		dfs1(1,-1);
		for(int i=1;i<=n;i++) {
			for(auto it:node[i]) {
				if(ban[it.second]&&it.first<i) {
					del.push_back({it.first,i});
				}
			}
		}
		for(int i=1;i<=n;i++) {
			if(!vis[i]) {
				temp_leaf.clear();
				dfs2(i,-1);
				if(temp_leaf.size()==2) {
					leaf.push_back({temp_leaf[0],temp_leaf[1]});
				} else {
					leaf.push_back({temp_leaf[0],temp_leaf[0]});
				}
			}
		}
		for(int i=1;i<(int)leaf.size();i++) {
			add.push_back({leaf[i-1].second,leaf[i].first});
		}
		cout<<del.size()<<endl;
		for(int i=0;i<(int)del.size();i++) {
			cout<<del[i].first<<' '<<del[i].second<<' '<<add[i].first<<' '<<add[i].second<<endl;
		}
	}
    return 0;
}