hdoj1874

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
#define maxx 0x100000


bool used[1005];
int cost[205][205],d[205],v,e,a,b,c;


void solve(int s){
fill(used,used+v,false);
fill(d,d+v,maxx);
d[s] = 0;
while(1){
int vv = -1;
for(int i = 0;i<v;++i){
if(used[i] == false&&(vv == -1||d[i] < d[vv])) vv = i;
}
    if(vv == -1)  break;
    used[vv] = true;
    for(int i = 0;i<v;++i)
    d[i] = min(d[i],d[vv] + cost[vv][i]);
}

}


int main(){
while(cin>>v>>e){
for(int i = 0;i<v;++i){
for(int j = 0;j<v;++j){
cost[i][j] = maxx;
}
}
for (int i = 0; i < e; i++)  
        {  
            cin>>a>>b>>c;  
            if(c < cost[a][b])       
            {  
                cost[a][b] = c; 
cost[b][a] = c; 
            }  
        }  
cin>>a>>b;
solve(a);
if(d[b] != maxx)
cout<<d[b]<<endl;
else
cout<<"-1\n";}
return 0;
}