#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>

using namespace std;
const int INF = 1e9 ;
const int N = 20;
const int M = 2010;

bool vis[N];
int eh[N],et[M],nxt[M],ef[M],ec[M],etot;
int s , t , n , m;
int d[N],cur[N];
void init(){
    memset( eh, -1 , sizeof eh) ;
    etot =0 ;
}
void addedge( int u , int v , int c ,int f){
    et[etot] = v ; nxt[etot] = eh[u]; ef[etot] = f; ec[etot] = c ; eh[u] = etot++;
    et[etot] = u ; nxt[etot] = eh[v]; ef[etot] = f; ec[etot] = 0 ; eh[v] = etot++;
}

bool bfs ()
{
    memset( vis , 0 , sizeof vis);
    queue< int >que;
    que.push(s) ;
    d[s] = 0;
    vis[s] =1 ;
    while( !que.empty() ) {
        int u = que.front(); que.pop();
        for( int i = eh[ u ] ; ~i ; i = nxt[i] ){
            int v = et[i] , c = ec[i] , f = ef[i];
            if( !vis[v] && c > f){
                vis[v] = 1 ;
                d[v] = d[u] + 1;
                que.push(v);
            }
        }
    }
    return vis[t];
}

int dfs (int x ,int a)
{
    if ( x == t || a == 0 ){
        return a ;
    }
    int flow = 0 , F;
    for( int &i = cur[x] ; ~i ; i = nxt[i] ){
        int v = et[i] , c = ec[i] , &f = ef[i];
        if( d[x] + 1 == d[v] && ( F = dfs (v, min( a, c - f))) > 0) {
            f += F;
            ef[ i ^ 1 ] -= F;
            flow += F;
            a -= F;
            if( a == 0 )break;
        }
    }
    return flow;
}

int MF(){
    int flow = 0 ;
    while( bfs() ){
        memcpy( cur , eh , sizeof eh );
        flow += dfs(s , INF);
    }
    return flow;
}

void run()
{
    int u,v,c;

    scanf("%d%d",&n,&m);

    init();

    while(m--){
        scanf("%d%d%d",&u, &v, &c);
        addedge( u ,v , c , 0 );
    }
    s = 1 , t = n;
    printf("%d\n",MF());
}

int main()
{
    #ifdef LOCAL
        freopen("in.txt","r",stdin);
    #endif // LOCAL
    int _ , cas = 1 ;
    scanf("%d",&_);
    while(_--){
        printf("Case %d: ",cas++);
        run();
    }
    return 0;
}