#include <stdio.h>
// MST, but checks for duplicate MSTs

int numVertices,numEdges;
int *parent,*weight,numTrees;

struct edge {
  int tail,head,weight;
};
typedef struct edge edgeType;
edgeType *edgeTab;

int find(x)
int x;
{
int i,j,root;

for (i=x;
     parent[i]!=i;
     i=parent[i])
  ;
root=i;
/* path compression */
for (i=x;
     parent[i]!=i;
     j=parent[i],parent[i]=root,i=j)
  ;
return root;
}

void makeEquivalent(i,j)
int i,j;
{
if (weight[i]>weight[j])
{
  parent[j]=i;
  weight[i]+=weight[j];
}
else
{
  parent[i]=j;
  weight[j]+=weight[i];
}
numTrees--;
}

int weightAscending(const void* xin, const void* yin)
/* Used in call to qsort() */
{
edgeType *x,*y;

x=(edgeType*) xin;
y=(edgeType*) yin;
return x->weight - y->weight;
}

int main()
{
int i,j,k;
int root1,root2;

scanf("%d %d",&numVertices,&numEdges);
edgeTab=(edgeType*) malloc(numEdges*sizeof(edgeType));
parent=(int*) malloc(numVertices*sizeof(int));
weight=(int*) malloc(numVertices*sizeof(int));
if (!edgeTab || !parent || !weight)
{
  printf("error 2\n");
  exit(0);
}
for (i=0;i<numEdges;i++)
  scanf("%d %d %d",&edgeTab[i].tail,&edgeTab[i].head,&edgeTab[i].weight);
for (i=0;i<numVertices;i++)
{
  parent[i]=i;
  weight[i]=1;
}
numTrees=numVertices;
qsort(edgeTab,numEdges,sizeof(edgeType),weightAscending);
i=0;
while (i<numEdges)
{
  for (k=i;
       k<numEdges && edgeTab[k].weight==edgeTab[i].weight;
       k++)
    ;
  for (j=i;j<k;j++)
  {
    root1=find(edgeTab[j].tail);
    root2=find(edgeTab[j].head);
    if (root1==root2)
    {
      printf("%d %d %d discarded\n",edgeTab[j].tail,edgeTab[j].head,
        edgeTab[j].weight);
      edgeTab[j].weight=(-1);
    }
  }
  for (j=i;j<k;j++)
    if (edgeTab[j].weight!=(-1))
    {
      root1=find(edgeTab[j].tail);
      root2=find(edgeTab[j].head);
      if (root1==root2)
        printf("%d %d %d alternate\n",edgeTab[j].tail,edgeTab[j].head,
          edgeTab[j].weight);
      else
      {
        printf("%d %d %d included\n",edgeTab[j].tail,edgeTab[j].head,
          edgeTab[j].weight);
        makeEquivalent(root1,root2);
      }
    }
  i=k;
}
if (numTrees!=1)
  printf("MST does not exist\n");
}