Internet Bandwidth

#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!\n");
#define D(X) cout<<"  "<<#X": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define IN(n) int n;scanf("%d",&n);
#define FOR(i, m, n) for (int i(m); i < n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
void ga(int N,int *A){F(N)scanf("%d",A+i);}
#define MX (128)
int G[MX][MX],cn[MX];
vi g[MX];
void ade(int f,int t,int v){
    if(!v)return;
    if(!G[f][t])g[f].PB(t);
    G[f][t]+=v;
}
#define cl CL(G,0);F(MX)g[i].clear();
int ap(int f,int t,int v){
    if(f==t)return v;
    if(cn[f]++)return 0;
    int h,r(v),T;
    F((ll)g[f].size()&&r)
        if(T=g[f][i],(h=ap(T,t,min(r,G[f][T])))){
            r-=h;
            if(!G[T][f])g[T].PB(f);
            G[T][f]+=h;
            if(!(G[f][T]-=h))g[f][i]=g[f].back(),g[f].pop_back(),--i;
        }
    return v-r;
}
int mf(int f,int t){
    int S(0),h;
    while(CL(cn,0),(h=ap(f,t,INF)))
        S+=h;
    return S;
}
int main(void){
    int s,t,M,a,b,c;
    IN(tt)F(tt){
        cl;IN(N);
        scanf("%d%d%d",&s,&t,&M);
        F(M)scanf("%d%d%d",&a,&b,&c),ade(a,b,c),ade(b,a,c);
        printf("Case %d: %d\n",i+1,mf(s,t));
    }
    return 0;
}