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
#include<iostream>
#include <functional>
#include<vector>
#include <queue>
#include<algorithm>

using namespace std;

struct edge
{
    edge(int to, long long weight) : v(to), w(weight) {}
    int v;
    long long w;
};

struct query
{
    query(long long _a, long long _b, long long _c) : a(_a), b(_b), c(_c) {}
    long long a;
    long long b;
    long long c;
};

struct node
{
    node(int p, bool v) : parent(p), visited(v) {}
    node() : node(0, false) {}
    int parent;
    bool visited;
};

struct sol
{
    sol(long long _f1, long long _f2, long long _f3, long long _m, int _j=0) : f1(_f1), f2(_f2), f3(_f3), m(_m), j(_j) {}
    long long f1; long long f2; long long f3; long long m; int j;
    bool operator<(const sol& other) const {
        return std::tie(f1, f2, f3, m, other.j) < std::tie(other.f1, other.f2, other.f3, other.m, j);
    }
    bool operator>(const sol& other) const {
        return std::tie(f1, f2, f3, m, other.j) > std::tie(other.f1, other.f2, other.f3, other.m, j);
    }
};

void trim(vector<sol>& next)
{
    sort(next.begin(), next.end(), greater<>());
    vector<sol> top;
    for(auto const& s : next)
    {
        bool gorsza = false;
        for(auto const& p : top)
        {
            if ((p.f1 >= s.f1) && (p.f2 >= s.f2) && (p.f3 >= s.f3) && (p.m >= s.m) && (p.j <= s.j))
            {
                gorsza = true;
                break;
            }
        }
        if (!gorsza)
        {
            top.push_back(s);
        }
    }
    next = top;
}

int main(void)
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    // dane
    int n;
    int q;
    cin >> n >> q;
    vector<vector<edge>> tree(n+1);
    for(int i = 0; i < n-1; i++)
    {
        int u, v; long long w;
        cin >> u >> v >> w;
        tree[u].push_back(edge(v, w));
        tree[v].push_back(edge(u, w));
        //idx?
    }

    vector<query> queries;
    for(int i = 0; i<q; i++)
    {
        long long a,b,c;
        cin >> a >> b >> c;
        queries.push_back(query(a,b,c));
    }

    vector<node> nodes(n+1);
    vector<int> orders; // root ->
    queue<int> Q;
    Q.push(1);
    nodes[1].visited = true;

    // topsort (BFS)
    while (!Q.empty())
    {
        auto u = Q.front();
        Q.pop();
        orders.push_back(u);
        for(const auto& e : tree[u])
        {
            if (!nodes[e.v].visited)
            {
                nodes[e.v].visited = true;
                nodes[e.v].parent = u;
                Q.push(e.v);
            }
        }
    }

    vector<vector<sol>> data(n+1);
    // #3
    for(auto it = orders.rbegin(); it != orders.rend(); it++) // od lisci
    {
        vector<sol> pareto;
        pareto.push_back(sol(0,0,0,0));

        int u = *it;
        for(const auto& e : tree[u])
        {
            if (nodes[e.v].parent != u)
                continue;

            vector<sol> next;
            for(auto const& su : pareto) // X1
            {
                for(auto const& sv : data[e.v]) {
                    long long inM = sv.m + e.w;

                    // wariant 1
                    vector<long long> p1 = {su.f1, su.f2, su.f3, sv.f1, sv.f2, sv.f3, inM};
                    sort(p1.begin(), p1.end(), greater<long long>());
                    next.push_back(sol(p1[0], p1[1], p1[2], su.m, su.j));
                    // wariant 2
                    if (su.m > 0) {
                        if (su.j == 0) {
                            vector<long long> p2 = {su.f1, su.f2, su.f3, sv.f1, sv.f2, sv.f3, inM+su.m};
                            sort(p2.begin(), p2.end(), greater<long long>());
                            next.push_back(sol(p2[0], p2[1], p2[2], 0, 1));
                        }
                    } else {
                        vector<long long> p2 = {su.f1, su.f2, su.f3, sv.f1, sv.f2, sv.f3, inM};
                        sort(p2.begin(), p2.end(), greater<long long>());
                        next.push_back(sol(p2[0], p2[1], p2[2], 0, su.j));
                    }
                    // waiant 3
                    vector<long long> p3 = {su.f1, su.f2, su.f3, sv.f1, sv.f2, sv.f3, su.m};
                    sort(p3.begin(), p3.end(), greater<long long>());
                    next.push_back(sol(p3[0], p3[1], p3[2], inM, su.j));
                    // wariant 4
                    vector<long long> p4 = {su.f1, su.f2, su.f3, sv.f1, sv.f2, sv.f3, su.m, inM};
                    sort(p4.begin(), p4.end(), greater<long long>());
                    next.push_back(sol(p4[0], p4[1], p4[2], 0, su.j));
                }
            }
            trim(next);
            pareto = next;
        } // main loop
        data[u] = pareto;
    }

    //#4 korzen
    vector<tuple<long long, long long, long long>> final;
    for(auto const& s : data[1]) // finalizacja tras
    {
        vector<long long> pp = {s.f1, s.f2,s.f3, s.m};
        sort(pp.begin(), pp.end(), greater<long long>());
        final.push_back(tuple(pp[0], pp[1], pp[2]));
    }

    sort(final.begin(), final.end(), greater<>());

    vector<tuple<long long,long long,long long>> top;

    for (auto const& s : final)
    {
        bool gorsza = false;
        for(auto const& p : top)
        {
            if ((get<0>(p) >= get<0>(s)) && (get<1>(p) >= get<1>(s)) && (get<2>(p) >= get<2>(s)))
            {
                gorsza = true;
                break;
            }
        }
        if (!gorsza)
            top.push_back(s);
    }

    //#5
    for(auto const& q : queries)
    {
        vector<long long> qq = {q.a, q.b, q.c};
        sort(qq.begin(), qq.end());
        long long a = qq[0], b = qq[1], c = qq[2];

        bool possible = false;
        for(auto [l1, l2, l3] : top)
        {
            if (l1 >= a + b + c) { possible = true; break; }
            if (l1 >= b + c && l2 >= a) { possible = true; break; }
            if (l1 >= a + c && l2 >= b) { possible = true; break; }
            if (l1 >= a + b && l2 >= c) { possible = true; break; }
            if (l1 >= c && l2 >= a + b) { possible = true; break; }
            if (l1 >= c && l2 >= b && l3 >= a) { possible = true; break; }
        }
        cout << (possible ? "TAK" : "NIE") << endl;
    }
    return 0;
}