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
#include <cassert>
#include <iostream>
#include <vector>

using namespace std;
using ll = long long;
#define all(a) begin(a), end(a)

vector<vector<pair<int, ll>>> adj;
vector<vector<int>> small;
vector<int> blocked;

vector<vector<int>> paths;

void dfs(int u, vector<int> &p) {
    p.push_back(u);
    paths.push_back(p);

    for (auto v : small[u]) {
        if (p.size() >= 2 && v == p[p.size() - 2]) {
            continue;
        }
        dfs(v, p);
    }
    p.pop_back();
}

void solve() {
    int n, q;
    cin >> n >> q;

    adj.assign(n, {});
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        ll w;
        cin >> u >> v >> w;
        --u;
        --v;
        adj[u].push_back({v, w});
        adj[v].push_back({u, w});
    }

    small.assign(n, {});
    auto ae = [&](int u, int v) {
        small[u].push_back(v);
        small[v].push_back(u);
    };

    for (int i = 0; i < n; i++) {
        for (auto [j, w] : adj[i]) {
            if (j < i) {
                continue;
            }

            int p = i;
            for (int t = 0; t < w - 1; t++) {
                small.push_back({});
                ae(p, (int)small.size() - 1);
                p = small.size() - 1;
            }
            ae(p, j);
        }
    }

    paths = {};
    for (int i = 0; i < small.size(); i++) {
        vector<int> p;
        dfs(i, p);
    }

    int m = small.size();

    vector<int> fr(m);
    auto mark_add = [&](vector<int> const &p, int d) {
        bool g = 1;
        for (int i = 1; i + 1 < p.size(); i++) {
            auto &t = fr[p[i]];
            g &= t == 0;
            t += d;
        }
        return g;
    };

    const int w = small.size();
    vector<vector<vector<int>>> pos(w + 1, vector<vector<int>>(w + 1, vector<int>(w + 1)));

    for (auto const &x : paths) {
        assert(mark_add(x, +1));
        for (auto const &y : paths) {
            if (!mark_add(y, +1)) {
                mark_add(y, -1);
                continue;
            }

            for (auto const &z : paths) {
                if (!mark_add(z, +1)) {
                    mark_add(z, -1);
                    continue;
                }

                pos[x.size() - 1][y.size() - 1][z.size() - 1] = 1;

                mark_add(z, -1);
            }

            mark_add(y, -1);
        }
        mark_add(x, -1);
    }

    while (q--) {
        ll a, b, c;
        cin >> a >> b >> c;
        if (a + b + c > w) {
            cout << "NIE\n";
            continue;
        }

        cout << (pos[a][b][c] ? "TAK\n" : "NIE\n");
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int q = 1;
    // cin >> q;
    while (q--) {
        solve();
    }
}