#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount

#define INF 1e16
#define mod 1000000007

struct UnionFind{
  vector<int> v;
  vector<bool> f; 
  UnionFind(int n) : v(n, -1),f(n,false) {}
  void init(){ for(int i = 0;i < v.size();i++)v[i]=-1; }
  int find(int x) { return v[x] < 0 ? x : find(v[x]); }
  bool unite(int x, int y) {
    x = find(x); y = find(y);
    if (x == y) return false;
    if (-v[x] < -v[y]) swap(x, y);
    v[x] += v[y]; v[y] = x;
    f[x]=(f[x]|f[y]);
    return true;
  }
  bool root(int x) { return v[x] < 0; }
  bool same(int x, int y) { return find(x) == find(y); }
  int size(int x) { return -v[find(x)]; }
  bool is_base(int x){ return f[find(x)]; }
};

struct edge{
  int u,v,cost;
};
bool operator<(const edge& a,const edge& b){
  return a.cost > b.cost;
}

int main(){
  int hoge=1;
  while(1){
    int n,t,k;
    cin>>n>>t>>k;
    if(n==0)break;
    UnionFind uf(n);
    vector<edge> es; 
    int res=0;
    rep(i,n-1){
      int a,b,c;
      cin>>a>>b>>c;
      a--;b--;
      res+=c;
      es.push_back((edge){a,b,c});
    }
    sort(all(es));
    rep(i,t){
      int a;
      cin>>a;
      a--;
      uf.f[a]=true;
    }
    int lim=t-k-1;
    for(int i=0,cnt=0;i<es.size()&&cnt<n-1-k;i++){
      if(uf.is_base(es[i].u)&&uf.is_base(es[i].v)){
        if(lim==0)continue;
        lim--;
      }
      uf.unite(es[i].u,es[i].v);
      res-=es[i].cost;
      cnt++;
    }
    cout<<"Case "<<hoge<<": "<<res<<endl;
    hoge++;
  }
  return 0;
}

