#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
struct Edge {
  int id, u, v, w, st;
  Edge() {}
  Edge(int _id, int _u, int _v, int _w, int _st) {
    id = _id;
    u = _u;
    v = _v;
    w = _w;
    st = _st;
  }
  bool operator<(const Edge &a) const { return w < a.w; }
} a[N];
vector<pair<int, int> > G[N];
int n, m, fa[N], dfn[N], low[N], dfs_clock;
bool cmp(const Edge &a, const Edge &b) { return a.id < b.id; }
int find(int x) {
  if (fa[x] != x) fa[x] = find(fa[x]);
  return fa[x];
}
void dfs(int u, int fa_id) {
  low[u] = dfn[u] = ++dfs_clock;
  for (int i = 0; i < G[u].size(); i++) {
    int v = G[u][i].first, id = G[u][i].second;
    if (id == fa_id) continue;
    if (!dfn[v]) {
      dfs(v, id);
      low[u] = min(low[u], low[v]);
      if (low[v] > dfn[u]) a[id].st = 2;
    } else
      low[u] = min(low[u], dfn[v]);
  }
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; i++) fa[i] = i;
  for (int i = 0; i < m; i++) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    a[i] = Edge(i + 1, u, v, w, 0);
  }
  sort(a, a + m);
  for (int i = 0; i < m; i++) {
    int s = i, e = i;
    while (e + 1 < m && a[e + 1].w == a[s].w) e++;
    for (int j = s; j <= e; j++) {
      int x = find(a[j].u), y = find(a[j].v);
      if (x == y) continue;
      G[x].push_back(make_pair(y, j));
      G[y].push_back(make_pair(x, j));
      a[j].st = 1;
    }
    for (int j = s; j <= e; j++) {
      int x = find(a[j].u), y = find(a[j].v);
      if (x == y || dfn[x]) continue;
      dfs(x, -1);
    }
    for (int j = s; j <= e; j++) {
      int x = find(a[j].u), y = find(a[j].v);
      if (x == y) continue;
      dfn[x] = dfn[y] = low[x] = low[y] = 0;
      G[x].clear();
      G[y].clear();
      fa[x] = y;
    }
    i = e;
  }
  sort(a, a + m, cmp);
  for (int i = 0; i < m; i++)
    if (a[i].st == 0)
      puts("none");
    else if (a[i].st == 1)
      puts("at least one");
    else
      puts("any");
  return 0;
}
