#include <bits/stdc++.h>
using namespace std;
const int maxn4 = 1e4 + 85, maxn5 = 1e5 + 69, maxn6 = 1e6 + 85,
          maxn7 = 1e7 + 69, maxn8 = 1e8 + 85, maxn9 = 1e9 + 69, modi1 = 1e7 + 7,
          modi2 = 1e9 + 7;
const long long int mod1 = 1e7 + 7, mod2 = 1e9 + 7;
int mn = INT_MAX, mx = INT_MIN;
int fir[maxn5], second[maxn5], weight[maxn5], dp[maxn5], h[maxn5], par[maxn5],
    ans[maxn6];
vector<pair<int, int> > g[maxn5];
vector<int> edge[maxn6];
bool mark[maxn5];
int get_par(int v) { return (par[v] < 0 ? v : par[v] = get_par(par[v])); }
void merge(int v, int u) {
  if ((v = get_par(v)) == (u = get_par(u))) return;
  if (par[v] < par[u]) swap(v, u);
  par[u] = v;
}
void dfs(int v, int p = -1, int indx = -1) {
  mark[v] = 1;
  dp[v] = h[v];
  for (int i = 0; i < g[v].size(); i++) {
    int u = g[v][i].first;
    int c = g[v][i].second;
    if (!mark[u]) {
      h[u] = h[v] + 1;
      dfs(u, v, c);
      ((dp[v]) = min((dp[v]), (dp[u])));
    } else if (c != indx)
      ((dp[v]) = min((dp[v]), (h[u])));
  }
  if (p != -1 and dp[v] == h[v]) ans[indx] = 2;
}
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    cin >> fir[i] >> second[i] >> weight[i];
    fir[i]--;
    second[i]--;
    weight[i]--;
    edge[weight[i]].push_back(i);
  }
  memset(par, -1, sizeof(par));
  for (int i = 0; i < 1e6 + 69; i++) {
    vector<int> vertex;
    for (int j = 0; j < edge[i].size(); j++) {
      int indx = edge[i][j];
      int v = fir[indx], u = second[indx];
      if (get_par(v) == get_par(u))
        ans[indx] = 1;
      else {
        int vv = get_par(v), uu = get_par(u);
        vertex.push_back(vv);
        vertex.push_back(uu);
        g[vv].push_back(make_pair(uu, indx));
        g[uu].push_back(make_pair(vv, indx));
      }
    }
    for (int j = 0; j < vertex.size(); j++) {
      if (!mark[vertex[j]]) {
        h[vertex[j]] = 0;
        dfs(vertex[j]);
      }
    }
    for (int j = 0; j < vertex.size(); j++)
      mark[vertex[j]] = 0, g[vertex[j]].clear();
    for (int j = 0; j < edge[i].size(); j++) {
      int indx = edge[i][j];
      int v = fir[indx], u = second[indx];
      merge(v, u);
    }
  }
  for (int i = 0; i < m; i++) {
    if (ans[i] == 2) cout << "any\n";
    if (ans[i] == 1) cout << "none\n";
    if (ans[i] == 0) cout << "at least one\n";
  }
  return 0;
}
