#include<bits/stdc++.h>

#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pii pair<int,int>
#define pill pair<int,ll>
#define pll pair<ll,ll>
#define pb push_back
#define fi first
#define se second
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define MASK(x) (((1)<<(x))-1)
#define getbit(x,k) (((x)>>(k))&1)

using namespace std;

const int maxn=1e5+50,mod=1e9+7;
const ll inf=0x3f3f3f3f3f3f3f3f;

int n,m;
vector<pii>eg[maxn],teg[maxn];
vector<pair<pii,int>>alle;
ll d1[maxn],d2[maxn],w1[maxn],w2[maxn];

void dijkstra(ll d[], ll w[], vector<pii>e[], int st)
{
    memset(d,0x3f,(n+10)*sizeof(ll));d[st]=0;
    priority_queue<pll,vector<pll>,greater<pll>>pQ;
    pQ.push({d[st],st});
    w[st]=1;
    while(pQ.size())
    {
        pll u=pQ.top();pQ.pop();
        if(u.fi!=d[u.se]) continue;
        for(pii v:e[u.se])
        {
            if(u.fi+v.se<d[v.fi])
            {
                d[v.fi]=u.fi+v.se;
                w[v.fi]=w[u.se];
                pQ.push({d[v.fi],v.fi});
            }
            else if(u.fi+v.se==d[v.fi])
                    w[v.fi]=(w[v.fi]+w[u.se])%mod;
        }
    }
}
int main()
{
    fastio
    freopen("tandeptrai.inp","r",stdin);
    freopen("tandeptrai.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int u,v,c;cin>>u>>v>>c;
        eg[u].pb({v,c});teg[v].pb({u,c});
        alle.pb({{u,v},c});
    }
    dijkstra(d1,w1,eg,1);dijkstra(d2,w2,teg,2);
    for(auto x:alle)
    {
        int u=x.ff,v=x.fs,c=x.se;
        ll nd=d1[v]+d2[u]+c;
        if(nd<d1[2]) cout<<"TAN\n";
        else if(nd==d1[2]) cout<<"DEP\n";
        else
        {
            if(d1[u]+d2[v]+c==d1[2] && (w1[u]*w2[v])%mod==w1[2])
                cout<<"TRAI\n";
            else cout<<"DEP\n";
        }
    }
}