#include <fstream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int v[32001],n,m,c[32001],maxi,ce,x,y;
int cauta(int x)
{
    if (v[x]!=x)
        v[x]=cauta(v[x]);
    return v[x];
}
void reuniune (int x, int y)
{
    int vx=cauta(v[x]);
    int vy=cauta(v[y]);
    if (vx!=vy)
        v[vy]=vx,c[x]+=c[y],c[y]=c[x];
}
int main()
{
    cin>>n>>m;
    for (int i=1;i<=n;i++)
        v[i]=i,c[i]=1;
    for (int i=1;i<=m;i++)
    {
        cin>>ce;
        if (ce==3)
        {
            cout<<maxi<<'\n';
        }
        else
        {
            cin>>x>>y;
            if (ce==1)
            {
                reuniune(x,y);
                maxi=max(maxi,c[x]);
            }
            else
                if (cauta(y)!=cauta(x))
                    cout<<"NU\n";
                else
                    cout<<"DA\n";

        }
    }
}