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.
#include<bits/stdc++.h>

using namespace std;

#define  GODSPEED       ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15);
#define  f              first
#define  s              second
#define  newl           cout<<"\n";
#define  pb             push_back
#define  mset(a,x)      memset(a,x,sizeof(a))
#define  debv(a)        for(auto it: a)cout<<it<<" ";newl;
#define  deb1(a)        cout<<a<<"\n";
#define  deb2(a,b)      cout<<a<<" "<<b<<"\n";
#define  deb3(a,b,c)    cout<<a<<" "<<b<<" "<<c<<"\n";
#define  deb4(a,b,c,d)  cout<<a<<" "<<b<<" "<<c<<" "<<d<<"\n";
#define  uniq(a)        a.resize(unique(a.begin(), a.end()) - a.begin());
#define  all(a)         a.begin(),a.end()

typedef  long long             ll;
typedef  long double           ld;
typedef  pair<ll, ll>           pll;
typedef  vector<ll>            vll;
typedef  vector<pll>           vpll;

const ll   N     =  3e5 + 5;
const ll   mod   =  1e9 + 7;
const ll   INF   =  0x7f7f7f7f7f7f7f7f;
const int  INFi  =  0x7f7f7f7f;
const ll   LEVEL =  log2(N) + 1;

ll n, l[N], r[N], p[N], sz[N], d[N], ct;
vector <int> adj[N];
map <pair <int, int>, int> vis;

void cl() {
	ct = 0;
	for (int i = 1; i <= n; i++) {
		adj[i].clear();
		l[i] = r[i] = d[i] = 0;
	}
	vis.clear();
}

void dfs(int x, int p) {
	d[x] = 0;
	for (auto it : adj[x]) {
		if (it == p) continue;
		dfs(it, x);
		if (d[x] == 2 || d[it] == 2) {
			ct++;
			vis[{min(x, it), max(x, it)}] = 1;
		} else {
			d[x]++;
			d[it]++;
		}
	}
}

void make(ll n){
	for(int i = 1; i <= n; i++){
		p[i] = i;
		sz[i] = 1;
	}
}

int find(ll x){
	return (p[x] == x)? x: p[x] = find(p[x]);
}

void merge(ll x, ll y){
	ll a = find(x);
	ll b = find(y);
	if(a != b){
		if(sz[a] >= sz[b]) swap(a,b);
		p[a] = b;
		sz[b] += sz[a];
	}
}

void solve() {
	cin >> n;
	cl();
	for (int i = 1; i < n; i++) {
		int u, v; cin >> u >> v;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	dfs(1, 0);
	make(n + 2);
	for (int i = 1; i <= n; i++) {
		for (auto it : adj[i]) {
			if (vis[{min(i, it), max(i, it)}] == 1) continue;
			merge(i, it);
		}
	}
	for (int i = 1; i <= n; i++) {
		if (d[i] <= 1) {
			int x = find(i);
			if (l[x]) r[x] = i;
			else l[x] = r[x] = i;
		}
	}
	deb1(ct)
	for (auto it : vis) {
		if (it.s == 0) continue;
		cout << it.f.f << " " << it.f.s << " ";
		cout << r[find(it.f.f)] << " " << l[find(it.f.s)] << "\n";
		// deb4(l[find(it.f.f)], r[find(it.f.f)], l[find(it.f.s)], r[find(it.f.s)])
		r[find(it.f.f)] = r[find(it.f.s)];
		l[find(it.f.s)] = l[find(it.f.f)];
		merge(it.f.f, it.f.s);
	}
}

int main() {
	GODSPEED;
	int test = 1;
	cin >> test;
	for (int i = 1; i <= test; i++) {
		solve();
	}
}