#include<bits/stdc++.h>

#define LL long long

#define fi first

#define se second

#define mk make_pair

#define PLL pair<LL, LL>

#define PLI pair<LL, int>

#define PII pair<int, int>

#define SZ(x) ((int)x.size())

#define ull unsigned long long

using namespace std;

const int N = 1e6 + ;

const int inf = 0x3f3f3f3f;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const int mod = 1e9 + ;

const double eps = 1e-;

const double PI = acos(-);

struct Edge {

    int a, b, id, tmp1, tmp2;

};

int n, m, fa[N], ans[N];

bool brige[N];

int dfn[N], low[N], idx;

vector<Edge> vc[N];

vector<PII> G[N];

int getRoot(int x) {

    return fa[x] == x ? x : fa[x] = getRoot(fa[x]);

}

void tarjan(int u, int id) {

    dfn[u] = low[u] = ++idx;

    for(auto& e : G[u]) {

        if(e.se == id) continue;

        if(!dfn[e.fi]) {

            tarjan(e.fi, e.se);

            low[u] = min(low[u], low[e.fi]);

            if(dfn[u] < low[e.fi]) brige[e.se] = true;

        } else low[u] = min(low[u], dfn[e.fi]);

    }

}

int main() {

    scanf("%d%d", &n, &m);

    for(int i = ; i <= n; i++) fa[i] = i;

    for(int i = ; i <= m; i++) {

        int a, b, w;

        scanf("%d%d%d", &a, &b, &w);

        vc[w].push_back(Edge{a, b, i, , });

    }

    for(int i = ; i <= ; i++) {

        if(!SZ(vc[i])) continue;

        idx = ;

        for(auto& e : vc[i]) {

            e.tmp1 = getRoot(e.a);

            e.tmp2 = getRoot(e.b);

            if(e.tmp1 > e.tmp2) swap(e.tmp1, e.tmp2);

        }

        for(auto& e : vc[i]) {

            if(e.tmp1 == e.tmp2) {

                ans[e.id] = ;

            } else {

                G[e.tmp1].clear();

                G[e.tmp2].clear();

                dfn[e.tmp1] = dfn[e.tmp2] = ;

            }

        }

        for(auto& e : vc[i]) {

            if(e.tmp1 != e.tmp2) {

                G[e.tmp1].push_back(mk(e.tmp2, e.id));

                G[e.tmp2].push_back(mk(e.tmp1, e.id));

            }

        }

        for(auto& e : vc[i]) {

            if(e.tmp1 != e.tmp2) {

                if(!dfn[e.tmp1]) tarjan(e.tmp1, );

                if(!dfn[e.tmp2]) tarjan(e.tmp2, );

            }

        }

        for(auto& e : vc[i]) {

            if(e.tmp1 != e.tmp2) {

                if(brige[e.id]) ans[e.id] = ;

                else ans[e.id] = ;

            }

        }

        for(auto& e : vc[i]) {

            int x = getRoot(e.a);

            int y = getRoot(e.b);

            if(x != y) fa[x] = y;

        }

    }

    for(int i = ; i <= m; i++) {

        if(ans[i] == ) puts("any");

        else if(ans[i] == ) puts("at least one");

        else puts("none");

    }

    return ;

}

/*

*/