def aa(m):
    c=x[m]
    while m!=uf[m]:
        m=uf[m];c+=x[m]
    return m,c

n,q=map(int,input().split())
uf=[i for i in range(n)]
x=[0]*n
y=[1]*n
for i in range(q):
    t,a,b=map(int,input().split())
    if t==1:
        a,_=aa(a-1);b,_=aa(b-1)
        if a==b:
            continue
        if y[a]<y[b]:
            a,b=b,a
        x[b]-=x[a]
        y[a]+=y[b]
        uf[b]=a
    elif t==2:
        a,_=aa(a-1)
        x[a]+=b
    else:
        a,b=aa(a-1)
        print(b)