#include <fstream>
#include<queue>
#define NMAX 200002


using namespace std;

ifstream fin("apm.in");
ofstream fout("apm.out");

struct muchie
        {int x, y;
         int cost;
         friend bool operator >(muchie, muchie);
        };

bool operator> (muchie a, muchie b)
{
    return a.cost>b.cost;
}
priority_queue<muchie, vector<muchie>, greater<muchie> > H;

int n, m, op, x, y;
int tata[NMAX];
int h[NMAX]; ///h[x]=inaltimea arborelui cu rad x;
int costmin;
muchie sel[NMAX];

int Find(int x); ///returneaza radacina arborelui din care face parte x
void Union(int x, int y); ///reuneste arborele din care face parte x cu arborele din care face parte y
void citire();
void Kruskal();
void afisare();

int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; i++) tata[i]=0;
    for(int i=1; i<=m; i++)
    {
        fin>>op>>x>>y;
        if(op==1) Union(x, y);
        else
        {
            if(Find(x)==Find(y)) fout<<"DA"<<'\n';
            else fout<<"NU"<<'\n';
        }
    }
   /* citire(); ///minheapul este creat
    Kruskal();
    afisare();*/

    return 0;
}

int Find(int x)
{
    int y;
    int rad=x;
    while(tata[rad]!=0)
    {
        rad=tata[rad];
    }

    ///compresez drumul
    while(tata[x])
    {
        y=tata[x];
        tata[x]=rad;
        x=y;
    }

    return rad;
}

void Union(int x, int y)
{
    int rx=Find(x);
    int ry=Find(y);
    if(h[rx]>h[ry])
    tata[ry]=rx;

    else
    {
        tata[rx]=ry;
        if(h[rx]==h[ry]) h[ry]++;
    }
}

void citire()
{
    muchie a;
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>a.x>>a.y>>a.cost;
        H.push(a);
    }
}

void Kruskal()
{
    muchie a;
    int nrsel=0, c1=0, c2=0;
    while(nrsel<n-1)
    {
     a=H.top();
     H.pop();
     c1=Find(a.x);
     c2=Find(a.y);
     if(c1!=c2)
     {
         sel[nrsel++]=a;
         costmin+=a.cost;
         Union(c1, c2);
     }
    }
}

void afisare()
{
    fout<<costmin<<'\n'<<n-1<<'\n';
    for(int i=0; i<n-1; i++)
        fout<<sel[i].x<<" "<<sel[i].y<<'\n';
}