#include "bits/stdc++.h"
using namespace std;

#define nl "\n"
#define ll long long
#define mod  1'000'000'007
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define sz(v) (int) v.size()

template<typename T = int>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v) in >> x;
    return in;
}

template<typename T = int>
ostream &operator<<(ostream &out, const vector<T> &v) {
    for (const T &x: v) out << x << " ";
    return out;
}

void Sira() {
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}
const int N = 1e5 + 5;
vector < int > adj[N];
int n , q;
vector < int > dest;

void dfs(int u , int depth , int v){
    for(auto & nxt : adj[u]){
        if(nxt == v) continue;
        dest[u] = depth;
                dfs(nxt , depth + 1 , u);
    }
}

void solve(){
    cin >> n >> q;

    for(int i = 0 ; i < n ; i++){
        adj[i].clear();
    }

    dest.assign(n + 5 , 0);

    for(int i = 0 ; i < n ; i++){
        int u , v;
        cin >> u >> v;

        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    vector < vector < int > > range(1e6 + 5);

    dfs(1 , -1);



    while(q--){
        int op;
        cin >> op;

        if(op == 1){
            int x , l , r;
            cin >> x >> l >> r;

            for(int i = l ; i <= r ; i++) range[i].push_back(x);
        }else{
            int x , t;
            cin >> x >> t;

            int node = -1 , d = 1e9;
            for(int i = 0 ; i < range[t].size() ; i++){
                cout << "range" << " " << dest[range[t][i]] - dest[x] << " ";
                if(d > abs(dest[range[t][i]] - dest[x])){
                    d = dest[range[t][i]];
                    node = range[t][i];
                }
            }

            cout << nl;

//            cout << node << nl;

        }
    }





}

int main() {
    Sira();
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}