#include <cstdio>

#include <algorithm>

#include <cstring>

#include <vector>

using namespace std;

const int INF=0x3f3f3f3f;

struct edge{int to,cap,cost,rev;};

const int MAX_V=10000;

int V,dist[MAX_V],prevv[MAX_V],preve[MAX_V];

vector<edge> G[MAX_V];

void add_edge(int from,int to,int cap,int cost){

    G[from].push_back((edge){to,cap,cost,G[to].size()});

    G[to].push_back((edge){from,0,-cost,G[from].size()-1});

}

int min_cost_flow(int s,int t,int f){

    int res=0;

    while(f>0){

        fill(dist,dist+V,INF);

        dist[s]=0;

        bool update=1;

        while(update){

            update=0;

            for(int v=0;v<V;v++){

                if(dist[v]==INF)continue;

                for(int i=0;i<G[v].size();i++){

                    edge &e=G[v][i];

                    if(e.cap>0&&dist[e.to]>dist[v]+e.cost){

                        dist[e.to]=dist[v]+e.cost;

                        prevv[e.to]=v;

                        preve[e.to]=i;

                        update=1;

                    }

                }

            }

        }

        if(dist[t]==INF)return -1;

        int d=f;

        for(int v=t;v!=s;v=prevv[v]){

            d=min(d,G[prevv[v]][preve[v]].cap);

        }f-=d;

        res+=d*dist[t];

        for(int v=t;v!=s;v=prevv[v]){

            edge &e=G[prevv[v]][preve[v]];

            e.cap-=d;

            G[v][e.rev].cap+=d;

        }

    }return res;

}

const int MAX_N=200;

int N,K;

int a[MAX_N],b[MAX_N],w[MAX_N];

void solve(){

    vector<int> x;

    for(int i=0;i<N;i++){

        x.push_back(a[i]);

        x.push_back(b[i]);

    }sort(x.begin(),x.end());

    x.erase(unique(x.begin(),x.end()),x.end());

    int m=x.size();

    int s=m,t=s+1;

    V=t+1;

    for(int i=0;i<=V;i++)G[i].clear();

    add_edge(s,0,K,0);

    add_edge(m-1,t,K,0);

    for(int i=0;i+1<m;i++)add_edge(i,i+1,INF,0);

    for(int i=0;i<N;i++){

        int u=find(x.begin(),x.end(),a[i])-x.begin();

        int v=find(x.begin(),x.end(),b[i])-x.begin();

        add_edge(u,v,1,-w[i]);

    }printf("%d\n",-min_cost_flow(s,t,K));

}

void init(){

    scanf("%d%d",&N,&K);

    for(int i=0;i<N;i++){

        scanf("%d%d%d",&a[i],&b[i],&w[i]);

    }

}

int T;

int main(){

    scanf("%d",&T);

    while(T--){

        init();

        solve();

    }return 0;

}

void solve(){

    vector<int> x;

    for(int i=0;i<N;i++){

        x.push_back(a[i]);

        x.push_back(b[i]);

    }sort(x.begin(),x.end());

    x.erase(unique(x.begin(),x.end()),x.end());

    int m=x.size();

    int s=m,t=s+1;

    V=t+1;

    for(int i=0;i<=V;i++)G[i].clear();

    int res=0;

    add_edge(s,0,K,0);

    add_edge(m-1,t,K,0);

    for(int i=0;i+1<m;i++)add_edge(i,i+1,INF,0);

    for(int i=0;i<N;i++){

        int u=find(x.begin(),x.end(),a[i])-x.begin();

        int v=find(x.begin(),x.end(),b[i])-x.begin();

        add_edge(v,u,1,w[i]);

        add_edge(s,v,1,0);

        add_edge(u,t,1,0);

        res-=w[i];

    }res+=min_cost_flow(s,t,K+N);

    printf("%d\n",-res);

}