#include <bits/stdc++.h>
using namespace std;
const long long MX = 1e5 + 9;
long long w[MX], ans[MX], par[MX], up[MX], dis[MX], mrk[MX];
pair<long long, long long> edg[MX], a[MX];
vector<pair<long long, long long> > adj[MX];
long long FS(long long v) {
  if (par[v] < 0) return v;
  return par[v] = FS(par[v]);
}
void US(long long a, long long b) {
  a = FS(a), b = FS(b);
  if (a == b) return;
  if (par[a] > par[b]) swap(a, b);
  par[a] += par[b];
  par[b] = a;
}
void DFS(long long u, long long p) {
  mrk[u] = 1;
  up[u] = dis[u];
  for (pair<long long, long long> v : adj[u]) {
    if (!mrk[v.first]) {
      dis[v.first] = dis[u] + 1;
      DFS(v.first, v.second);
      if (up[v.first] <= dis[u])
        ans[v.second] = 1;
      else
        ans[v.second] = 2;
      up[u] = min(up[u], up[v.first]);
    } else if (v.second != p) {
      up[u] = min(up[u], dis[v.first]);
      ans[v.second] = 1;
    }
  }
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long n, m;
  cin >> n >> m;
  for (long long i = 0; i < m; i++) {
    cin >> edg[i].first >> edg[i].second >> w[i];
    a[i] = {w[i], i};
  }
  fill(par, par + MX, -1);
  sort(a, a + m);
  long long j = 0;
  for (long long i = 0; i < m; i = j) {
    vector<long long> v;
    set<long long> s;
    while (j < m && a[i].first == a[j].first) {
      long long ind = a[j].second, f = FS(edg[ind].first),
                g = FS(edg[ind].second);
      if (f == g)
        ans[ind] = -1;
      else {
        s.insert(f), s.insert(g);
        v.push_back(ind);
        adj[f].push_back({g, ind}), adj[g].push_back({f, ind});
      }
      j++;
    }
    while (!s.empty()) {
      long long u = *s.begin();
      s.erase(s.begin());
      if (!mrk[u]) DFS(u, u);
    }
    for (long long x : v) {
      long long f = FS(edg[x].first), g = FS(edg[x].second);
      up[f] = up[g] = dis[f] = dis[g] = mrk[f] = mrk[g] = 0;
      adj[g].clear(), adj[f].clear();
      US(f, g);
    }
  }
  for (long long i = 0; i < m; i++) {
    if (ans[i] == -1) cout << "none" << '\n';
    if (ans[i] == 1) cout << "at least one" << '\n';
    if (ans[i] == 2) cout << "any" << '\n';
  }
  return 0;
}
