#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <vector>

 using namespace std;

 const int MAXN = ;

 int par[MAXN] , ans[MAXN][MAXN];

 vector<int> v[MAXN];

 void init(int n) {  //初始化

     for(int i =  ; i <= n ; i++) {

         par[i] = i;

         for(int j = i +  ; j <= n ; j++) {

             ans[i][j] = ans[j][i] = ;

         }

         v[i].clear();

         v[i].push_back(i);   //清空后加入本身

     }

 }

 int Find(int n) {

     if(n == par[n])

         return n;

     return par[n] = Find(par[n]);

 }

 int main()

 {

     int t , n , m , x , a , b , last , res;

     scanf("%d" , &t);

     while(t--) {

         scanf("%d %d" , &n , &m);

         init(n);

         last =  , res = n;   //res为联通块数

         for(int ca =  ; ca <= m ; ca++) {

             scanf("%d %d %d" , &x , &a , &b);

             a = a ^ last , b = b ^ last;

             int aa = Find(a) , bb = Find(b);

             if(x == ) {

                 if(aa != bb) {     //不为同一个联通块

                     par[aa] = bb;

                     res--;

                     int xx = v[a].size() , yy = v[b].size();  //预先记录容器大小,不然下面的加点会使size增大

                     for(int i =  ; i < xx ; i++) {    //更新答案 加点

                         for(int j =  ; j < yy ; j++) {

                             ans[v[a][i]][v[b][j]] = ans[v[b][j]][v[a][i]] = ca;

                             v[v[a][i]].push_back(v[b][j]);

                             v[v[b][j]].push_back(v[a][i]);

                         }

                     }

                 }

                 last = res;

                 printf("%d\n" , last);

             }

             else {

                 last = ans[a][b];

                 printf("%d\n" , last);

             }

         }

     }

 }