#include <bits/stdc++.h>

using namespace std;

const int N = 20, M = 1240, T = 262150;
const short INF = 0x3f3f;

int n, u[N], v[N], w[N];
int g[N][N], gg[N][N];
char tmp[N], s[M][N];
int m, l[M], e[M], c[M], p[M], h[M], lvl[M];
short f[M][T], fr[M][T];
int sta[N], tt;
int ans, answ[N], ansc, ansp[N];

inline void DFS(int u, int fa, int fr, int st, int le, int count)
{
    if(st)
    {
        m ++ ;
        e[m] = st, l[m] = le, c[m] = fr * (n + 1) + u;
        for(int i = 0; i < le; i ++ ) s[m][i] = tmp[i];
    }
    for(int v = 1; v <= n; v ++ )
        if(gg[u][v] && v != fa)
        {
            if(g[u][v] < 2)
            {
                tmp[le] = g[u][v];
                DFS(v, u, fr, st | (1 << (gg[u][v] - 1)), le + 1, count);
            }
            else if(count < 2)
            {
                tmp[le] = 0;
                DFS(v, u, fr, st | (1 << (gg[u][v] - 1)), le + 1, count + 1);
                tmp[le] = 1;
                DFS(v, u, fr, st | (1 << (gg[u][v] - 1)), le + 1, count + 1);
            }
            else
            {
                tmp[le] = 1;
                DFS(v, u, fr, st | (1 << (gg[u][v] - 1)), le + 1, count + 1);
            }
        }
}
inline bool Cmp(int i, int j)
{
    for(int k = 0; k < min(l[i], l[j]); k ++ )
        if(s[i][k] != s[j][k])
            return s[i][k] < s[j][k];
    return l[i] < l[j];
}
inline int LCP(int i, int j)
{
    for(int k = 0; k < min(l[i], l[j]); k ++ )
        if(s[i][k] != s[j][k])
            return k;
    return min(l[i], l[j]);
}
inline void Sort(int l[])
{
    for(int i = 1; i <= m; i ++ ) lvl[i] = l[p[i]];
    for(int i = 1; i <= m; i ++ ) l[i] = lvl[i];
}
inline void GetStrings()
{
    m = 0;
    for(int i = 1; i <= n; i ++ ) DFS(i, 0, i, 0, 0, 0);
    for(int i = 1; i <= m; i ++ ) p[i] = i;
    sort(p + 1, p + m + 1, Cmp);
    Sort(e), Sort(c);
    for(int i = 1; i < m; i ++ ) h[i] = LCP(p[i], p[i + 1]);
}

inline void DP()
{
    int S = (1 << (n - 1)) - 1;
    for(int j = 0; j <= S; j ++ ) f[0][j] = INF;
    f[0][0] = 0, fr[0][0] = 0;
    tt = 0;
    for(int i = 1; i <= m; i ++ )
    {
        for(int j = 0; j <= S; j ++ )
            f[i][j] = f[i - 1][j], fr[i][j] = -1;
        while(tt && h[sta[tt]] >= h[i - 1]) tt -- ;
        sta[ ++ tt] = i - 1;
        for(int j = 1; j <= tt; j ++ )
        {
            int k = S ^ e[i];
            do{
                if(f[i][k | e[i]] > f[sta[j]][k] + h[sta[j]])
                {
                    f[i][k | e[i]] = f[sta[j]][k] + h[sta[j]];
                    fr[i][k | e[i]] = sta[j];
                }
                k = (k - 1) & (S ^ e[i]);
            }while(k != (S ^ e[i]));
        }
    }
}
inline void GetPath()
{
    if(ans <= f[m][(1 << (n - 1)) - 1]) return ;
    ans = f[m][(1 << (n - 1)) - 1];
    for(int i = 1; i < n; i ++ ) answ[i] = g[u[i]][v[i]];
}

int main()
{
    int T;
    scanf("%d%*d", &T);
    puts("0");
    while(T -- )
    {
        memset(g, 0, sizeof g);
        memset(gg, 0, sizeof gg);
        ans = INF;
        scanf("%d", &n);
        for(int i = 1; i < n; i ++ )
        {
            scanf("%d%d%d", &u[i], &v[i], &w[i]);
            u[i] ++ , v[i] ++ ;
            g[u[i]][v[i]] = g[v[i]][u[i]] = w[i];
            gg[u[i]][v[i]] = gg[v[i]][u[i]] = i;
        }
        GetStrings(), DP(), GetPath();
        printf("%d\n", n - ans);
    }
    return 0;
}