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>

#define ll long long
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define pii pair<int, int>
#define rep(i, a, b) for(int i = (a); i < (b); i++)
using namespace std;
template<typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;

struct dsu {
    vector<int> a;
    dsu(size_t n) {
        a.assign(n, -1);
    }
    size_t find(size_t x) {
        return a[x] < 0 ? x : a[x] = find(a[x]);
    }
    size_t size(size_t x) {
        return -a[find(x)];
    }
    bool join(size_t x, size_t y) {
        if((x = find(x)) == (y = find(y))) return false;
        if(a[x] > a[y]) swap(x, y);
        a[x] += a[y];
        a[y] = x;
        return true;
    }
};

void solve() {
    int n;
    cin >> n;
    vector<vi> g(n + 1);
    set<pii> ed;
    rep(i, 0, n - 1) {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
        ed.insert({u, v});
        ed.insert({v, u});
    }
    // 0 -> remove parent edge
    // 1 -> don't
    vi dp0(n + 1), dp1(n + 1);
    vi ch0(n + 1), ch1(n + 1);
    function<void(int, int)> dfs = [&](int x, int p) {
        vector<pii> a(2, make_pair(0, -1));
        int sum = 0;
        for(int y : g[x]) {
            if(y != p) {
                dfs(y, x);
                sum += 1 + dp0[y];
                a.push_back({dp1[y] - (1 + dp0[y]), y});
            }
        }
        sort(all(a));
        ch0[x] = a[0].second;
        ch1[x] = a[1].second;
        dp0[x] = sum + a[0].first + a[1].first;
        dp1[x] = sum + a[0].first;
    };
    vector<pii> add, rem;
    function<void(int, int, bool)> dfs2 = [&](int x, int p, bool b) {
        for(int y : g[x]) {
            if(y != p) {
                if(y == ch0[x] || (!b && y == ch1[x])) {
                    dfs2(y, x, 1);
                }else {
                    rem.push_back({x, y});
                    ed.erase({x, y});
                    ed.erase({y, x});
                    dfs2(y, x, 0);
                }
            }
        }
    };
    dfs(1, 1);
    dfs2(1, 1, 0);
    dsu D(n + 1);
    vi deg(n + 1, 0);
    for(auto &pa : ed) {
        D.join(pa.first, pa.second);
        deg[pa.first]++;
        deg[pa.second]++;
    }
    vector<vi> ve(n + 1);
    rep(i, 1, n + 1) {
        if(deg[i] <= 2) ve[D.find(i)].push_back(i);
        if(deg[i] == 0) ve[D.find(i)].push_back(i);
    }
    int last = -1;
    rep(i, 1, n + 1) {
        if(!ve[i].empty()) {
            if(last != -1) add.push_back({last, ve[i][0]});
            last = ve[i][1];
        }
    }
    
    cout << dp0[1] << '\n';
    assert(dp0[1] == sz(add) && dp0[1] == sz(rem));
    rep(i, 0, dp0[1]) {
        cout << rem[i].first << ' ' << rem[i].second << ' ' << add[i].first << ' ' << add[i].second << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int te;
    cin >> te;
    while(te--) solve();
}