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
#pragma GCC optimize(2, 3, "Ofast", "inline", "unroll-loops")
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
template <class T>
using Ve = vector<T>;
#define ALL(v) (v).begin(), (v).end()
#define pii pair<ll, ll>
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define per(i, a, b) for(int i = (a); i >= (b); --i)
#define pb push_back
ll read() {
    ll x = 0, f = 1; char ch = getchar();
    while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
    while(ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
    return x * f;
}
void write(ll x) {
    if(x < 0) putchar('-'), x = -x;
    if(x > 9) write(x / 10);
    putchar(x % 10 + '0');
}
bool Mbe;
const ll N = 2e5 + 9;
ll B, T;
ll n, Q, fa[N], ord[N], tim;
Ve<pii> to[N];
void dfs(ll x, ll f) {
    fa[x] = f, ord[++tim] = x;
    for(auto [y, w] : to[x]) {
        if(y == f) continue;
        dfs(y, x);
    }
}
struct Dat {
    ll a[3], b;
};
Ve<Dat> dp[N][3];
void Ins(ll *a, ll x) {
    rep(i, 0, 2) {
        if(x > a[i]) {
            per(j, 2, i + 1) a[j] = a[j - 1];
            a[i] = x;
            break;
        }
    }
}
void Mrg(ll *c, ll *a, ll *b) {
    ll i = 0, j = 0;
    rep(k, 0, 2) {
        if(a[i] >= b[j]) c[k] = a[i], ++i;
        else c[k] = b[j], ++j;
    }
}
bool ooo;
void Push(Ve<Dat> &a, Dat x) {
    if(ooo) {
        for(Dat &y : a) {
            if(y.a[0] >= x.a[0] && y.a[1] >= x.a[1] && y.a[2] >= x.a[2] && y.b >= x.b) return ;
        }
    }
    a.pb(x);
}
bool oo;
void Form(Ve<Dat> &a, bool o = 0) {
    if(!o && a.size() <= B) return ;
    Ve<Dat> b;
    b.reserve(min((size_t)B, a.size()));
    auto Add = [&](auto cmp, int lim) {
        sort(ALL(a), cmp);
        int cnt = 0;
        for(Dat &x : a) {
            if(b.size() == B) return;
            bool dom = false;
            for(Dat &y : b) {
                if(y.a[0] >= x.a[0] && y.a[1] >= x.a[1] && y.a[2] >= x.a[2] && y.b >= x.b) {
                    dom = true;
                    break;
                }
            }
            if(!dom) {
                b.pb(x), ++cnt;
                if(cnt == lim) break;
            }
        }
    };
    Add([](const Dat& u, const Dat& v){ return u.a[0] > v.a[0]; }, T);
    Add([](const Dat& u, const Dat& v){ return u.a[1] > v.a[1]; }, T);
    Add([](const Dat& u, const Dat& v){ return u.a[2] > v.a[2]; }, T);
    Add([](const Dat& u, const Dat& v){ return u.b > v.b; }, T); 
    if(oo) {
        Add([](const Dat& u, const Dat& v){ return u.a[0] + u.b > v.a[0] + v.b; }, T);
        Add([](const Dat& u, const Dat& v){ return u.a[0] + u.a[1] + u.b > v.a[0] + v.a[1] + v.b; }, T);
        Add([](const Dat& u, const Dat& v){ return u.a[0] + u.a[1] + u.a[2] > v.a[0] + v.a[1] + v.a[2]; }, T);
    }
    Add([](const Dat& u, const Dat& v){ return u.a[0] + u.a[1] + u.a[2] + u.b > v.a[0] + v.a[1] + v.a[2] + v.b; }, B);
    a = std::move(b);
}
bool check(ll x, ll *a, ll *b) {
    if(x == 3) return 1;
    rep(i, 0, 2) {
        if(a[i] >= b[x]) {
            a[i] -= b[x];
            if(check(x + 1, a, b)) {
                a[i] += b[x];
                return 1;
            }
            a[i] += b[x];
        }
    }
    return 0;
}
bool Med;
int main() {
    // freopen("A.in", "r", stdin);
    // freopen("A.out", "w", stdout);
    cerr << fabs(&Med - &Mbe) / 1048576.0 << "MB\n";
    n = read(), Q = read();
    if(n <= 2000) B = 700, T = 70, oo = 1;
    else if(n <= 10000) B = 80, T = 20, oo = 1;
    else B = 25, T = 3, oo = 1, ooo = 1;
    rep(i, 2, n) {
        ll x = read(), y = read(), z = read();
        to[x].pb({y, z}), to[y].pb({x, z});
    }
    dfs(1, 0);
    per(iii, n, 1) {
        ll u = ord[iii];
        dp[u][0].pb({{0, 0, 0}, 0});
        for(auto [v, w] : to[u]) {
            if(v == fa[u]) continue;
            Ve<Dat> vec;
            rep(i, 0, 2) {
                for(auto &x : dp[v][i]) vec.pb(x);
                Ve<Dat>().swap(dp[v][i]);
            }
            Form(vec);
            Ve<Dat> nw[3];
            for(auto &x : vec) {
                Dat f1 = x, f2 = x;
                Ins(f1.a, f1.b + w);
                for(auto &y : dp[u][0]) {
                    Dat f; Mrg(f.a, y.a, f1.a), f.b = 0; Push(nw[0], f);
                    Mrg(f.a, y.a, f2.a), f.b = x.b + w; Push(nw[1], f);
                }
                for(auto &y : dp[u][1]) {
                    Dat f; Mrg(f.a, y.a, f1.a), f.b = y.b; Push(nw[1], f);
                    Mrg(f.a, y.a, f2.a), Ins(f.a, y.b + x.b + w), f.b = 0; Push(nw[2], f);
                }
                for(auto &y : dp[u][2]) {
                    Dat f; Mrg(f.a, y.a, f1.a), f.b = 0; Push(nw[2], f);
                }
            }
            rep(i, 0, 2) {
                Form(nw[i], 1);
                dp[u][i] = std::move(nw[i]);
            }
        }
    }
    
    Ve<Dat> F;
    rep(i, 0, 2) {
        for(auto x : dp[1][i]) {
            Ins(x.a, x.b);
            F.pb(x);
        }
    }
    Form(F, 1);
    while(Q--) {
        ll x = read(), y = read(), z = read();
        ll b[3] = {z, y, x}; 
        bool flag = 0;
        for(auto f : F) {
            if(f.a[0] + f.a[1] + f.a[2] < b[0] + b[1] + b[2]) continue;
            if(check(0, f.a, b)) {
                flag = 1;
                break;
            }
        }
        if(flag) puts("TAK");
        else puts("NIE");
    }
    cerr << "\n" << clock() * 1.0 / CLOCKS_PER_SEC * 1000 << "ms\n";
    return 0;
}