#include <bits/stdc++.h>
using namespace std;
const int N = 100010, M = N << 1;
struct Edge {
  int a, b, w, type, id;
  bool operator<(const Edge &W) const { return w < W.w; }
} edges[N];
int h[N], e[M], num[M], ne[M], idx;
void add(int a, int b, int c) {
  e[idx] = b, num[idx] = c, ne[idx] = h[a], h[a] = idx++;
}
int p[N];
int find(int x) {
  if (p[x] != x) p[x] = find(p[x]);
  return p[x];
}
int dfn[N], low[N], tot;
void tarjan(int u, int fa) {
  dfn[u] = low[u] = ++tot;
  for (int i = h[u]; ~i; i = ne[i]) {
    int j = e[i], k = num[i];
    if (k == fa) continue;
    if (!dfn[j]) {
      tarjan(j, k);
      low[u] = min(low[u], low[j]);
      if (low[j] > dfn[u]) edges[k].type = 2;
    } else
      low[u] = min(low[u], dfn[j]);
  }
}
int res[N];
int main() {
  memset(h, -1, sizeof h);
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) p[i] = i;
  for (int i = 0; i < m; i++) {
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    edges[i] = (Edge){a, b, c, 0, i};
  }
  sort(edges, edges + m);
  for (int i = 0, j; i < m; i = j + 1) {
    j = i;
    while (j + 1 < m and edges[j + 1].w == edges[i].w) j++;
    for (int k = i; k <= j; k++) {
      int a = find(edges[k].a), b = find(edges[k].b);
      if (a != b) {
        add(a, b, k);
        add(b, a, k);
        edges[k].type = 1;
      }
    }
    for (int k = i; k <= j; k++) {
      int a = find(edges[k].a), b = find(edges[k].b);
      if (a != b and !dfn[a]) tarjan(a, -1);
    }
    for (int k = i; k <= j; k++) {
      int a = find(edges[k].a), b = find(edges[k].b);
      if (a != b) {
        h[a] = h[b] = -1;
        dfn[a] = dfn[b] = 0;
        p[a] = b;
      }
    }
  }
  for (int i = 0; i < m; i++) res[edges[i].id] = edges[i].type;
  for (int i = 0; i < m; i++) {
    if (!res[i])
      puts("none");
    else if (res[i] == 1)
      puts("at least one");
    else
      puts("any");
  }
  return 0;
}
