#include <bits/stdc++.h>
using namespace std;
const int M = 200005;
int ans[M], low[M], dfn[M], head[M], n, m, fa[M], tot = 0, timestamp = 0;
struct node {
  int to, nex, id;
} e[M * 2];
struct edge {
  int a, b, c, id;
} ed[M];
inline void rd(int &res) {
  res = 0;
  char c;
  while (c = getchar(), c < 48)
    ;
  do res = (res << 3) + (res << 1) + (c ^ 48);
  while (c = getchar(), c > 47);
}
void print(int x) {
  if (x == 0) return;
  print(x / 10);
  putchar((x % 10) ^ 48);
}
bool cmp(edge a, edge b) { return a.c < b.c; }
int get(int x) {
  if (fa[x] != x) fa[x] = get(fa[x]);
  return fa[x];
}
void dfs(int x, int id) {
  dfn[x] = low[x] = ++timestamp;
  for (int i = head[x]; ~i; i = e[i].nex) {
    int to = e[i].to, eid = e[i].id;
    if (dfn[to] == 0) {
      dfs(to, i);
      low[x] = min(low[x], low[to]);
      if (low[to] > dfn[x]) ans[eid] = 1;
    } else if (dfn[to] < dfn[x] && i != (id ^ 1))
      low[x] = min(low[x], low[to]);
  }
}
void add_edge(int a, int b, int id) {
  e[tot] = (node){b, head[a], id};
  head[a] = tot++;
}
void get_union(int a, int b) {
  a = get(a);
  b = get(b);
  if (a != b) fa[a] = b;
}
int main() {
  int i, j, k, a, b, c, en;
  rd(n);
  rd(m);
  for (i = 1; i <= m; i++) {
    rd(a);
    rd(b);
    rd(c);
    ed[i] = (edge){a, b, c, i};
  }
  sort(ed + 1, ed + 1 + m, cmp);
  for (i = 1; i <= n; i++) fa[i] = i, head[i] = -1;
  for (i = 1; i <= m; i++) {
    for (j = i; j <= m; j++) {
      if (ed[j + 1].c != ed[i].c) break;
    }
    en = j;
    for (j = i; j <= en; j++) {
      ed[j].a = a = get(ed[j].a);
      ed[j].b = b = get(ed[j].b);
      dfn[a] = 0;
      dfn[b] = 0;
      low[a] = 0;
      low[b] = 0;
      head[a] = -1;
      head[b] = -1;
    }
    for (j = i; j <= en; j++) {
      a = ed[j].a;
      b = ed[j].b;
      if (a == b) {
        ans[ed[j].id] = 2;
        continue;
      }
      add_edge(a, b, ed[j].id);
      add_edge(b, a, ed[j].id);
    }
    for (j = i; j <= en; j++) {
      if (!dfn[ed[j].a]) dfs(ed[j].a, -1);
      if (!dfn[ed[j].b]) dfs(ed[j].b, -1);
    }
    for (j = i; j <= en; j++) {
      get_union(ed[j].a, ed[j].b);
    }
    i = en;
  }
  for (i = 1; i <= m; i++)
    if (ans[i] == 2)
      puts("none");
    else if (ans[i] == 1)
      puts("any");
    else
      puts("at least one");
  return 0;
}
