1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
#include <bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define RFOR(i,p,n) for(int i=(p);i>=(n);--i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define ssize(x) int((x).size())
#define fi first
#define se second
#define V vector
#define pb push_back
#define eb emplace_back
#define C const
#define gc getchar_unlocked
#define pc putchar_unlocked
#define pn putchar_unlocked('\n')
using namespace std;
typedef long long ll;
typedef __int128_t lll;
typedef V<int> vi;
typedef V<ll> vll;
typedef const int ci;
typedef const ll cll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
void chmin(auto &a, auto b){a=min(a,b);}
void chmax(auto &a, auto b){a=max(a,b);}
ci inf = 2.1e9;
cll infll = 4.5e18;
int I(){
    int z;
    int c = gc();
    while(c < '0' || c > '9') c = gc();
    for(z = 0; c >= '0' && c <= '9'; c = gc()) z = 10*z+c-'0';
    return z;
}
ll LL(){
    ll z;
    int c = gc();
    while(c < '0' || c > '9') c = gc();
    for(z = 0; c >= '0' && c <= '9'; c = gc()) z = 10*z+c-'0';
    return z;
}

void answer(){
    int n = I();
    ci q = I();

    V<vi> g(n+1);
    auto dod_wierz = [&](){
        return g.eb(), ssize(g)-1;
    };
    vi dokad;
    vll dl;
    auto dod_kraw = [&](ci a, ci b, cll c){
        g[a].eb(ssize(dokad));
        dokad.eb(b);
        dl.eb(c);
        g[b].eb(ssize(dokad));
        dokad.eb(a);
        dl.eb(c);
    };
    REP(i, n-1){
        ci a = I();
        ci b = I();
        cll c = LL();
        ci aa = dod_wierz();
        ci bb = dod_wierz();
        dod_kraw(a, aa, 0);
        dod_kraw(aa, bb, c);
        dod_kraw(bb, b, 0);
    }
    n = ssize(g)-1;

    vi wyn(q, 0);
    vll a(q), b(q), c(q);
    REP(i, q){
        a[i] = LL();
        b[i] = LL();
        c[i] = LL();
    }

    V tab_odl(n+1, vll(n+1, 0));
    FOR(korz, 1, n){
        auto dfs = [&](this auto &&rek, ci w, ci oj) -> void{
            for(ci nr : g[w]) if(dokad[nr] != oj){
                tab_odl[korz][dokad[nr]] = dl[nr]+tab_odl[korz][w];
                rek(dokad[nr], w);
            }
        };
        dfs(korz, 0);
    }
    auto daj_odl = [&](int x, int y){
        return tab_odl[x][y];
    };

    struct srednica{
        int x, y;
        ll odl;
    };
    auto samotny = [&](ci w){
        return srednica{w, w, 0};
    };
    auto zlacz = [&](srednica raz, srednica dwa){
        srednica ret = raz.odl > dwa.odl ? raz : dwa;
        for(int x : {raz.x, raz.y}) for(int y : {dwa.x, dwa.y}){
            if(ll tmp = daj_odl(x, y); tmp > ret.odl) ret = srednica{x, y, tmp};
        }
        return ret;
    };

    V<srednica> dp(ssize(dokad));

    auto dfs_dol = [&](this auto &&rek, ci w, ci oj) -> srednica{
        srednica ret = samotny(w);
        for(ci nr : g[w]) if(dokad[nr] != oj){
            dp[nr] = rek(dokad[nr], w);
            ret = zlacz(ret, dp[nr]);
        }
        return ret;
    };
    srednica sr_cale = dfs_dol(1, 0);

    auto dfs_gora = [&](this auto &&rek, ci w, ci oj, srednica sr) -> void{
        REP(_, 2){
            srednica pref = sr;
            for(ci nr : g[w]) if(dokad[nr] != oj){
                dp[nr^1] = _ ? zlacz(dp[nr^1], pref) : pref;
                pref = zlacz(pref, dp[nr]);
            }
            reverse(all(g[w]));
        }
        for(ci nr : g[w]) if(dokad[nr] != oj){
            rek(dokad[nr], w, zlacz(dp[nr^1], samotny(dokad[nr])));
        }
    };
    dfs_gora(1, 0, samotny(1));

    // jedna ścieżka
    {
        REP(i, q) if(a[i]+b[i]+c[i] <= sr_cale.odl) wyn[i] = 1;
    }

    // dwie ścieżki
    {
        V<pll> wazne;
        REP(nr, ssize(dokad)){
            ll raz = dp[nr].odl;
            ll dwa = dp[nr^1].odl;
            if(raz > dwa) swap(raz, dwa);
            wazne.eb(raz, dwa);
        }
        sort(all(wazne));

        V<pll> stos;
        for(pll para : wazne){
            while(ssize(stos) && para.se >= stos.back().se) stos.pop_back();
            stos.eb(para);
        }

        auto pytaj = [&](pll pyt){
            if(pyt.fi > pyt.se) swap(pyt.fi, pyt.se);
            auto it = lower_bound(all(stos), pyt);
            return it != stos.end() && pyt.fi <= it->fi && pyt.se <= it->se;
        };

        REP(i, q){
            if(pytaj(pll{a[i]+b[i], c[i]})) wyn[i] = 1;
            if(pytaj(pll{a[i]+c[i], b[i]})) wyn[i] = 1;
            if(pytaj(pll{b[i]+c[i], a[i]})) wyn[i] = 1;
        }
    }

    // trzy ścieżki
    {
        using arr = array<ll, 3>;
        V<pair<arr, int>> zap(q);
        REP(i, q) zap[i] = {{a[i], b[i], c[i]}, i};
        sort(rall(zap));

        V<arr> wazne;
        auto dupa = [&](){
            set<pll> secik;
            int licz = 0;
            auto wrzuc = [&](pll para){
                auto it = secik.lower_bound(para);
                if(it != secik.end() && para.se <= it->se) return;
                while(it != secik.begin() && (--it)->se <= para.se) it = secik.erase(it);
                secik.emplace(para);
                ++licz;
            };
            auto pytaj = [&](pll para){
                auto it = secik.lower_bound(para);
                if(it != secik.end() && para.se <= it->se) return true;
                return false;
            };
            sort(rall(wazne));
            int it = 0;
            for(auto [pyt, i] : zap){
                while(it < ssize(wazne) && wazne[it][0] >= pyt[0]){
                    wrzuc(pll{wazne[it][1], wazne[it][2]});
                    ++it;
                }
                if(pytaj(pll{pyt[1], pyt[2]})) wyn[i] = 1;
            }
            wazne.clear();
        };

        V<srednica> jajco(ssize(dokad));
        FOR(korz, 1, n) for(ci nr_sas : g[korz]) if(dl[nr_sas] == 0){
            auto dfs_gora = [&](this auto &&rek, ci w, ci oj, srednica sr) -> void{
                REP(_, 2){
                    srednica pref = sr;
                    for(ci nr : g[w]) if(nr != nr_sas) if(dokad[nr] != oj){
                        jajco[nr^1] = _ ? zlacz(jajco[nr^1], pref) : pref;
                        pref = zlacz(pref, dp[nr]);
                        if(_ == 1){
                            rek(dokad[nr], w, zlacz(jajco[nr^1], samotny(dokad[nr])));
                            arr tmp = {dp[nr_sas].odl, dp[nr].odl, jajco[nr^1].odl};
                            sort(all(tmp));
                            wazne.eb(tmp);
                            if(ssize(wazne) >= max(q, 10)) dupa();
                        }
                    }
                    reverse(all(g[w]));
                }
            };
            dfs_gora(korz, 0, samotny(korz));
        }
        dupa();
    }

    for(ci x : wyn){
        if(x) pc('T'), pc('A'), pc('K'), pn;
        else pc('N'), pc('I'), pc('E'), pn;
    }
}

int main(){
    int tt = 1;
    while(tt--) answer();
}