uva 10048

蠻白吃的 本來還想要用priority queue做 結果有點失誤

索性用找的，最後一次AC了

//============================================================================
// Name        : Audiophobia.cpp
// Date : 2013/3/24 下午12:17:50
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#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 105
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
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);
}
struct node{
    int to,w;
}ntmp;
vector<node> mz[M];
int d[M];
int n,w,q;
//struct cmp{
//    bool operator()(int &a,int &b){
//        return a<b;
//    }
//};
void addpath(int x,int y,int w){
    ntmp.to=y;
    ntmp.w=w;
    mz[x].PB(ntmp);
    ntmp.to=x;
    mz[y].PB(ntmp);
}
void solve(int src,int end){
//    priority_queue<int,vector<int>,cmp> pq;
    fill(&d[0],&d[M-1],oo);
    int vis[M];
    Set(vis,0);
    d[src]=0;
//    vis[src]=1;
//    pq.push(src);
    while(1){
        int u=-1;
        for(int i=1;i<=n;i++){
            if(!vis[i]&&(d[i]<d[u]||u==-1))u=i;
        }
        if(u==-1)break;
//        int u=pq.top();pq.pop();
        FOR(it,mz[u]){
            int v=(*it).to,w=(*it).w;
            w=max(w,d[u]);
            if(!vis[v]&&d[v]>w){
//                debug("u%d v%d w%d\n",u,v,w);
                d[v]=w;
//                pq.push(v);
            }
        }
        vis[u]=1;
    }
    if(d[end]==oo)printf("no path\n");
    else printf("%d\n",d[end]);
}
int main() {
    ios_base::sync_with_stdio(0);
    int ff=0;
    while(~scanf("%d%d%d",&n,&w,&q)&&n+w+q){
        for(int i=0;i<w;i++){
            int u,v,weight;
            scanf("%d%d%d",&u,&v,&weight);
            addpath(u,v,weight);
        }
        if(ff)Pln();
        printf("Case #%d\n",++ff);
        for(int i=0;i<q;i++){
            int s,e;
            scanf("%d%d",&s,&e);
            solve(s,e);
        }
        for(int i=0;i<=n;i++)mz[i].clear();
    }

}