#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define mp make_pair
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
char c = getchar_unlocked();
int x = 0;
while (c < '0' || c > '9')
{
c = getchar_unlocked();
}
while (c >= '0' && c <= '9')
{
x = (x << 1) + (x << 3) + c - '0';
c = getchar_unlocked();
}
return x;
}
void phongbeo();
const int inf = 1e9;
const ll mod2 = 998244353;
const int mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
if(x+y>=mod2) x-=mod2;
if(x+y<0)x+=mod2;
return x+y;
}
struct icd
{
long double a;
int b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a, b, c;
};
struct id
{
int a, b, c, d;
};
struct ie
{
int a, b, c, d, e;
};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int i, s10, s12,k1,k2,k3,s11,lim,w,l,r ;
int kk;
int el = 19;
main()
{
if(fopen(task".inp","r"))
{
fin(task);
fou(task);
}
NHP
/// cin>>s1;
// modwwe
phongbeo();
// checktime
}
vector<int> v[100001];
int head[100001];
int heavy[100001];
int in[100001];
int ou[100001];
int st[17][100001];
vector<ic> ask;
struct dsuconcu
{
ib dsu[100001];
void reset()
{
for(int i=1; i<=n; i++)
dsu[i]= {1,i};
}
int get(int x)
{
if(dsu[x].b==x) return x;
return dsu[x].b=get(dsu[x].b);
}
bool noi(int x,int y)
{
x=get(x);
y=get(y);
if(x==y) return 0;
if(dsu[x].a<dsu[y].a)swap(x,y);
dsu[x].a+=dsu[y].a;
dsu[y].b=x;
return 1;
}
} ds;
int dfs(int x,int y)
{
st[0][x]=y;
int sz=0,mxz=0;
for(auto f:v[x])
if(f^y)
{
int s=dfs(f,x);
sz+=s;
if(s>mxz)
{
mxz=s;
heavy[x]=f;
}
}
return sz;
}
void des(int x,int y)
{
head[x]=y;
in[x]=++dem;
if(heavy[x]!=0)
des(heavy[x],y);
for(auto f:v[x])
if(!in[f])
des(f,f);
ou[x]=dem;
}
struct st
{ int t[400001];
void build(int node,int l,int r)
{
t[node]=r-l+1;
if(l==r) return;
int mid=l+r>>1;
build(node<<1,l,mid);
build(node<<1|1,mid+1,r);
}
int get(int node,int l,int r,int l1,int r1,bool x)
{
if(l>r1||r<l1||t[node]==0) return 0;
if(l>=l1&&r<=r1)
{
int kk=t[node];
if(x) t[node]=0;
return kk;
}
int mid=l+r>>1;
int a1=get(node<<1,l,mid,l1,r1,x);
int b1=get(node<<1|1,mid+1,r,l1,r1,x);
t[node]=t[node<<1]+t[node<<1|1];
return a1+b1;
}
} seg;
int get(int x,int y,bool z)
{
if(in[head[x]]<=in[y])return seg.get(1,1,n,in[y],in[x],z);
return seg.get(1,1,n,in[head[x]],in[x],z)+get(st[0][head[x]],y,z);
}
bool check(int x,int y)
{
if(in[x]<=in[y]&&in[y]<=ou[x]) return 1;
return 0;
}
int lca(int x,int y)
{
if(check(x,y))return x;
for(int i=16; i>=0; --i)
if(!check(st[i][x],y))
x=st[i][x];
return st[0][x];
}
int solve(int x,int y,bool z)
{
k=lca(x,y);
return get(x,k,z)+get(y,k,z)-get(k,k,z)*2;
}
void phongbeo()
{
cin>>n>>m;
ds.reset();
seg.build(1,1,n);
for(int i=1; i<=m; i++)
{
cin>>l>>r>>s2;
if(l==1)
if(ds.noi(r,s2))
{
v[r].pb(s2);
v[s2].pb(r);
}
ask.pb({l,r,s2});
}
ds.reset();
for(int i=1; i<=n; i++)
if(st[0][i]==0)
dfs(i,0);
for(int i=1; i<=n; i++)
if(!in[i])
des(i,i);
ou[0]=dem;
for(auto x:ask)
{
if(x.a==1)
{
if(!ds.noi(x.b,x.c))
{
solve(x.b,x.c,1);
}
}
else
{
s2=ds.get(x.b);
s3=ds.get(x.c);
if(s2!=s3)
{
cout<<-1;
}
else
{
cout<<solve(x.b,x.c,0);
}
down
}
}
}
