#include <bits/stdc++.h>
using namespace std;
int n, m, fa[100005], ans[100005];
bool vis[100005];
int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }
struct edge {
  int u, v, w, i;
  bool operator<(const edge x) const { return w < x.w; }
} e[100005];
vector<pair<int, int> > g[100005];
int low[100005], dfn[100005], idx;
void tarjan(int u) {
  low[u] = dfn[u] = ++idx;
  for (pair<int, int> i : g[u]) {
    int v = i.first;
    if (v != fa[v] || vis[i.second]) continue;
    vis[i.second] = 1;
    if (!dfn[v]) {
      tarjan(v);
      low[u] = min(low[u], low[v]);
      if (dfn[u] < low[v]) ans[i.second] = 1;
    } 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 = 1; i <= m; ++i)
    scanf("%d%d%d", &e[i].u, &e[i].v, &e[i].w), e[i].i = i;
  sort(e + 1, e + m + 1);
  for (int i = 1, j = 1, u, v; i <= m; i = j = j + 1) {
    while (j < m && e[j].w == e[j + 1].w) ++j;
    for (int k = i; k <= j; ++k) {
      u = find(e[k].u), v = find(e[k].v);
      if (u == v) {
        ans[e[k].i] = -1;
        continue;
      }
      g[u].push_back(make_pair(v, e[k].i));
      g[v].push_back(make_pair(u, e[k].i));
      dfn[u] = dfn[v] = 0;
    }
    for (int k = i; k <= j; ++k) {
      if (ans[e[k].i] == -1) continue;
      u = find(e[k].u), v = find(e[k].v);
      if (!dfn[u]) tarjan(u);
    }
    for (int k = i; k <= j; ++k) {
      if (ans[e[k].i] == -1) continue;
      u = find(e[k].u), v = find(e[k].v);
      if (u != v) fa[u] = v;
    }
  }
  for (int i = 1; i <= m; ++i)
    puts(!ans[i] ? "at least one" : (ans[i] > 0 ? "any" : "none"));
  return 0;
}
