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
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1'000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1'000'000'007LL;
const int N = 1'000'007;
int vis[N];
vector<pair<int, ll>> ed[N];
int q;
ll que[N][3], dp[N];

void DFSL(int v, ll& ans)
{
    dp[v] = 0LL; vis[v] = 1;
    for(int i = 0; i < (int)ed[v].size(); ++i)
    {
        int ne = ed[v][i].st;
        if(vis[ne]) continue;
        DFSL(ne, ans);
        ans = max(ans, dp[v] + dp[ne] + ed[v][i].nd);
        dp[v] = max(dp[v], dp[ne] + ed[v][i].nd);
    }
    vis[v] = 0;
}

void DFSA(int v, vector<int> &z)
{
    z.pb(v); vis[v] = 1;
    for(int i = 0; i < (int)ed[v].size(); ++i)
    {
        int ne = ed[v][i].st;
        if(vis[ne]) continue;
        DFSA(ne, z);
    }
    vis[v] = 0;
}

vector<bitset<8>> Do(int v, int xdd)
{
    // cerr << "Do " << v << " " << xdd << "\n";
    ll cur = 0LL;
    DFSL(v, cur);
    vector<bitset<8>> ans(q, bitset<8>());
    for(int i = 0; i < q; ++i)
    {
        for(int k = 0; k < 8; ++k)
        {
            ll s = 0LL;
            for(int j = 0; j < 3; ++j)
                if((1<<j)&k)
                    s += que[i][j];
            if(cur >= s)
                ans[i][k] = 1;
            else
                ans[i][k] = 0;
        }
    }
    if(1 == xdd) return ans;

    vector<int> akt;
    DFSA(v, akt);
    for(int l = 0; l < (int)akt.size(); ++l)
    {
        int av = akt[l];
        vector<int> cure;
        vector<bitset<8>> r1, r2;
        for(int i = 0; i < (int)ed[av].size(); ++i)
        {
            if(vis[ed[av][i].st]) continue;
            cure.pb(ed[av][i].st);
        }
        for(int i = 0; i < (int)cure.size(); ++i)
        {
            int ne = cure[i];
            vector<int> tb;
            for(int j = 0; j < (int)cure.size(); ++j)
                if(j != i)
                    {vis[cure[j]] = 1; tb.pb(cure[j]);}

            r1 = Do(av, xdd - 1);
            for(int j = 0; j < (int)tb.size(); ++j)
                vis[tb[j]] = 0;
            tb.clear();

            vis[ne] = 1;
            r2 = Do(av, xdd - 1);
            vis[ne] = 0;
            for(int j = 0; j < q; ++j)
                for(int k = 0; k < 8; ++k)
                    for(int h = 0; h < 8; ++h)
                        ans[j][k | h] = ans[j][k | h] | (r1[j][k] & r2[j][h]);
        }
    }
    return ans;
}

void Solve()
{
    int n, a, b;
    ll c;
    cin >> n >> q;
    for(int i = 1; i < n; ++i)
    {
        cin >> a >> b >> c;
        ed[a].pb(pair{b, c});
        ed[b].pb(pair{a, c});
    }
    for(int i = 0; i < q; ++i)
        for(int r = 0; r < 3; ++r)
            cin >> que[i][r];
    vector<bitset<8>> ans = Do(1, 3);
    for(int i = 0; i < q; ++i)
        if(ans[i][7])
            cout << "TAK\n";
        else
            cout << "NIE\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // int t; cin >> t;
    // while(t--)
        Solve();

    return 0;
}