uva 11733

雖然說是普通的MST，可是要考慮蓋機場的錢比造路的錢還要少

這時候比個大小就可以了

//
//        GGGGGGGGGGGGG        CCCCCCCCCCCCC               AAA
//     GGG::::::::::::G     CCC::::::::::::C              A:::A
//   GG:::::::::::::::G   CC:::::::::::::::C             A:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C            A:::::::A
// G:::::G       GGGGGG C:::::C       CCCCCC           A:::::::::A
//G:::::G              C:::::C                        A:::::A:::::A
//G:::::G              C:::::C                       A:::::A A:::::A
//G:::::G    GGGGGGGGGGC:::::C                      A:::::A   A:::::A
//G:::::G    G::::::::GC:::::C                     A:::::A     A:::::A
//G:::::G    GGGGG::::GC:::::C                    A:::::AAAAAAAAA:::::A
//G:::::G        G::::GC:::::C                   A:::::::::::::::::::::A
// G:::::G       G::::G C:::::C       CCCCCC    A:::::AAAAAAAAAAAAA:::::A
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C   A:::::A             A:::::A
//   GG:::::::::::::::G   CC:::::::::::::::C  A:::::A               A:::::A
//     GGG::::::GGG:::G     CCC::::::::::::C A:::::A                 A:::::A
//        GGGGGG   GGGG        CCCCCCCCCCCCCAAAAAAA                   AAAAAAA
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
#include <ctime>
using namespace std;
#ifdef DEBUG
#define VAR(a,b) decltype(b) a=(b)
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)
#define gettime() end_time=clock();printf("now running time is %.7f\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);
#else
#define VAR(a,b) __typeof(b) a=(b)
#define debug(...)
#define gettime()
#endif
typedef unsigned int uint;
typedef long long int Int;
typedef unsigned long long int UInt;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 10005
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)
#define eps 1e-6
clock_t start_time=clock(), end_time;
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
int p[M];
int rk[M];
int n,m,a;
struct edges{
    int x,y,w;
}edge[M*100];
bool cmp(edges a,edges b){
    return a.w<b.w;
}
void init(){
    for(int i=0;i<=n;i++){
        p[i]=i;rk[i]=0;
    }
}
int getf(int x){
    if(x!=p[x])p[x]=getf(p[x]);
    return p[x];
}
void _union(int x,int y){
    if(rk[x]>rk[y]){
        p[y]=x;
    }else{
        p[x]=y;
        if(rk[x]==rk[y])rk[y]++;
    }
}
void solve(){
    sort(edge,edge+m,cmp);
    int ans=0;
    int pl=0;
    for(int i=0;i<m;i++){
        int x=edge[i].x,y=edge[i].y;
        int w=edge[i].w;
        x=getf(x);
        y=getf(y);
        if(x!=y){
//            debug("%d %d\n",x,y);
            _union(x,y);
            if(w<a)ans+=w;
            else pl++,ans+=a;
        }
    }
    for(int i=1;i<=n;i++){
        if(p[i]==i)pl++,ans+=a;
    }
    printf("%d %d\n",ans,pl);
}
int main() {
    ios_base::sync_with_stdio(0);
    int test,ff=0;
    scanf("%d",&test);
    while(test--){
        scanf("%d%d%d",&n,&m,&a);
        init();
        for(int i=0;i<m;i++){
            int x,y,w;
            scanf("%d%d%d",&x,&y,&w);
            edge[i].x=x;edge[i].y=y;
            edge[i].w=w;
        }
        printf("Case #%d: ",++ff);
        solve();
    }

















}