#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 17;
vector<pair<int, int>> ve, vec[N];
bool f[N];
int dis[N], h[N], par[N], a[N], b[N], wi[N], ans[N], pos[N];
int root(int x) {
  while (par[x] != 0) {
    x = par[x];
  }
  return x;
}
void merge(int x, int y) {
  x = root(x);
  y = root(y);
  vec[x].clear();
  vec[y].clear();
  f[x] = false;
  f[y] = false;
  if (x == y) {
    return;
  }
  if (h[x] > h[y]) {
    par[y] = x;
  } else {
    par[x] = y;
    if (h[x] == h[y]) {
      h[y]++;
    }
  }
}
void add(int x, int y, int z) {
  if (x == y) {
    return;
  }
  ans[z] = 1;
  vec[x].push_back({y, z});
  vec[y].push_back({x, z});
}
void dfs(int x, int y, int hi) {
  f[x] = true;
  dis[x] = hi;
  for (auto u : vec[x]) {
    if (!f[u.first]) {
      dfs(u.first, u.second, hi + 1);
      dis[x] = min(dis[x], dis[u.first]);
    } else if (u.second != y) {
      dis[x] = min(dis[x], dis[u.first]);
    }
  }
  if (dis[x] == hi) {
    ans[y] = 2;
  }
}
bool migam(int &aa, int &bb) { return wi[aa] < wi[bb]; }
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    cin >> a[i] >> b[i] >> wi[i];
    pos[i] = i;
  }
  sort(pos + 1, pos + m + 1, migam);
  for (int i = 1; i <= m;) {
    int j;
    if (i == 1) {
    }
    for (j = i; wi[pos[j]] == wi[pos[i]]; j++) {
      add(root(a[pos[j]]), root(b[pos[j]]), pos[j]);
    }
    for (j = i; wi[pos[j]] == wi[pos[i]]; j++) {
      int k = root(a[pos[j]]);
      if (!f[k]) {
        dfs(k, 0, 0);
      }
    }
    for (j = i; wi[pos[i]] == wi[pos[j]]; j++) {
      merge(a[pos[j]], b[pos[j]]);
    }
    i = j;
  }
  for (int i = 1; i <= m; i++) {
    if (!ans[i]) {
      cout << "none" << endl;
    } else if (ans[i] == 1) {
      cout << "at least one" << endl;
    } else {
      cout << "any" << endl;
    }
  }
  return 0;
}
