#include <bits/stdc++.h>
using namespace std;
struct drum {
  int x, y, c, id;
  bool all = false, none = false;
  bool operator<(drum b) const { return c < b.c; }
};
struct nodS {
  int par, d, dp;
  bool viz;
  vector<int> v;
};
bool compid(drum a, drum b) { return a.id < b.id; }
int n, m, i, j, dr, t;
drum e[100005];
nodS nod[100005];
int dsu[100005];
map<pair<int, int>, int> ma;
stack<int> s;
int dsu_grup(int x) {
  if (dsu[x] == x) return x;
  dsu[x] = dsu_grup(dsu[x]);
  return dsu[x];
}
void dsu_merge(int x, int y) {
  x = dsu_grup(x);
  y = dsu_grup(y);
  if (x != y) dsu[y] = x;
}
void refr(int x) {
  if (nod[x].viz) {
    nod[x].viz = false;
    nod[x].dp = 0;
    nod[x].v.clear();
  }
}
void dfs(int p, int par) {
  nod[p].viz = true;
  nod[p].d = nod[par].d + 1;
  nod[p].par = par;
  for (int it : nod[p].v) {
    if (it == par) continue;
    if (nod[it].viz) {
      if (nod[it].d < nod[p].d) {
        nod[p].dp++;
        nod[it].dp--;
      }
    } else {
      dfs(it, p);
      nod[p].dp += nod[it].dp;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  for (i = 1; i <= n; i++) {
    dsu[i] = i;
  }
  for (i = 1; i <= m; i++) {
    cin >> e[i].x >> e[i].y >> e[i].c;
    e[i].id = i;
  }
  sort(e + 1, e + m + 1);
  for (i = 1; i <= m; i++) {
    ma.clear();
    t = 0;
    for (j = i; j <= m; j++) {
      if (e[j].c == e[i].c)
        dr = j;
      else
        break;
    }
    for (j = i; j <= dr; j++) {
      e[j].x = dsu_grup(e[j].x);
      e[j].y = dsu_grup(e[j].y);
      if (e[j].x == e[j].y) {
        e[j].none = true;
        continue;
      }
      if (e[j].x > e[j].y) swap(e[j].x, e[j].y);
      ma[{e[j].x, e[j].y}]++;
      refr(e[j].x);
      refr(e[j].y);
      nod[e[j].x].v.push_back(e[j].y);
      nod[e[j].y].v.push_back(e[j].x);
    }
    for (j = i; j <= dr; j++) {
      if (e[j].none) continue;
      if (!nod[e[j].x].viz) dfs(e[j].x, 0);
      if (nod[e[j].x].d < nod[e[j].y].d) swap(e[j].x, e[j].y);
      if (nod[e[j].x].par == e[j].y && nod[e[j].x].dp == 0) e[j].all = true;
      if (e[j].x > e[j].y) swap(e[j].x, e[j].y);
      if (ma[{e[j].x, e[j].y}] > 1) e[j].all = false;
    }
    for (j = i; j <= dr; j++) {
      if (!e[j].none) dsu_merge(e[j].x, e[j].y);
    }
    i = dr;
  }
  sort(e + 1, e + m + 1, compid);
  for (i = 1; i <= m; i++) {
    if (e[i].none) {
      cout << "none\n";
      continue;
    }
    if (e[i].all) {
      cout << "any\n";
    } else {
      cout << "at least one\n";
    }
  }
  return 0;
}
