#include <bits/stdc++.h>
using namespace std;
int n, m, in1, in2, in3, siz, opt, ccn;
int op[100001], fa[100001];
int hav[100001];
vector<pair<int, pair<int, int> > > ed[100001][2];
int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
int main() {
  scanf("%d%d", &n, &m);
  if (n == m + 1) {
    for (int i = 1; i <= m; i++) {
      printf("any\n");
    }
    return 0;
  }
  for (int i = 1; i <= m; i++) {
    scanf("%d%d%d", &in1, &in2, &in3);
    ed[in1][opt].push_back(
        pair<int, pair<int, int> >(in3, pair<int, int>(in2, i)));
    ed[in2][opt].push_back(
        pair<int, pair<int, int> >(in3, pair<int, int>(in1, i)));
  }
  for (int i = 1; i <= n; i++) {
    fa[i] = i;
  }
  while (true) {
    if (siz == 1) break;
    ccn++;
    for (int i = 1; i <= n; i++) {
      if (ed[i][opt].empty()) continue;
      if (ed[i][opt].size() == 1) {
        op[ed[i][opt][0].second.second] = 1;
        if (find(i) != find(ed[i][opt][0].second.first))
          fa[fa[i]] = fa[ed[i][opt][0].second.first];
        continue;
      }
      sort(ed[i][opt].begin(), ed[i][opt].end());
      if (ed[i][opt][0].first != ed[i][opt][1].first) {
        op[ed[i][opt][0].second.second] = 1;
        if (find(i) != find(ed[i][opt][0].second.first))
          fa[fa[i]] = fa[ed[i][opt][0].second.first];
        continue;
      }
    }
    if (ccn >= 300) {
      for (int i = 1; i <= n; i++) {
        if (ed[i][opt].empty()) continue;
        if (ed[i][opt].size() == 1) continue;
        vector<pair<int, pair<int, int> > >::iterator ite = ed[i][opt].begin(),
                                                      ite1 = ite + 1;
        if (op[ite->second.second] == 1) continue;
        while (ite1 != ed[i][opt].end() && ite->first == ite1->first) {
          if (op[ite1->second.second] == 1) goto hh;
          ite++;
          ite1++;
        }
        ite = ed[i][opt].begin(), ite1 = ite + 1;
        op[ite->second.second] = 2;
        if (find(i) != find(ite->second.first))
          fa[fa[i]] = fa[ite->second.first];
        while (ite1 != ed[i][opt].end() && ite->first == ite1->first) {
          op[ite1->second.second] = 2;
          if (find(i) != find(ite1->second.first))
            fa[fa[i]] = fa[ite1->second.first];
          ite++;
          ite1++;
        }
      hh:;
      }
      break;
    }
    memset(hav, 0, sizeof(hav));
    siz = 0;
    for (int i = 1; i <= n; i++) {
      if (!hav[find(i)]) {
        hav[find(i)] = ++siz;
      }
    }
    for (int i = 1; i <= siz; i++) {
      ed[i][opt ^ 1].clear();
    }
    for (int i = 1; i <= n; i++) {
      for (vector<pair<int, pair<int, int> > >::iterator ite =
               ed[i][opt].begin();
           ite != ed[i][opt].end(); ite++) {
        if (find(i) != find(ite->second.first)) {
          ed[hav[find(i)]][opt ^ 1].push_back(pair<int, pair<int, int> >(
              ite->first, pair<int, int>(hav[find(ite->second.first)],
                                         ite->second.second)));
        }
      }
    }
    for (int i = 1; i <= siz; i++) {
      fa[i] = i;
    }
    n = siz;
    opt ^= 1;
  }
  for (int i = 1; i <= m; i++) {
    if (op[i] == 1) printf("any\n");
    if (op[i] == 2) printf("at least one\n");
    if (op[i] == 0) printf("none\n");
  }
  return 0;
}
