n张车票;
m个城市;
p条边,
从u->v 花费len[u][v]/ 所选车票
求从start到end 最小花费
dp[s][u] ,剩余车票集合,当前所在城市u ;
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
new POJ2686().solve();
}
}
class POJ2686 {
InputReader in = new InputReader(System.in);
PrintWriter out = new PrintWriter(System.out);
int[] ticket = new int[10] ;
double[][] len = new double[108][108] ;
double[][] dp = new double[1<<10][108] ;
void solve() {
int n , m , p , start , end ;
while(true){
n = in.nextInt() ;
m = in.nextInt() ;
p = in.nextInt() ;
start = in.nextInt() - 1 ;
end = in.nextInt() - 1 ;
if(n == 0) break ;
for(int i = 0 ; i < m ; i++) Arrays.fill(len[i] , -1) ;
for(int i = 0 ; i < n ; i++) ticket[i] = in.nextInt() ;
while(p-- > 0){
int u = in.nextInt() - 1 ;
int v = in.nextInt() - 1 ;
double w = in.nextDouble() ;
len[u][v] = len[v][u] = w ;
}
int all = (1<<n) - 1 ;
for(int i = 0 ; i <= all ; i++) Arrays.fill(dp[i] , Double.MAX_VALUE) ;
dp[all][start] = 0 ;
double res = Double.MAX_VALUE ;
for(int s = all ; s >= 0 ; s--){
res = Math.min(res , dp[s][end]) ;
for(int i = 0 ; i < n ; i++){
if((s & (1<<i)) == 0) continue ;
for(int u = 0 ; u < m ; u++){
for(int v = 0 ; v < m ; v++){
if(len[u][v] >= 0){
dp[s ^ (1<<i)][v] = Math.min(dp[s ^ (1<<i)][v] , dp[s][u] + len[u][v] / ticket[i]) ;
}
}
}
}
}
if(res == Double.MAX_VALUE)
out.println("Impossible") ;
else{
out.printf("%.3f" , res) ;
out.println() ;
}
}
out.flush() ;
}
}
class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = new StringTokenizer("");
}
private void eat(String s) {
tokenizer = new StringTokenizer(s);
}
public String nextLine() {
try {
return reader.readLine();
} catch (Exception e) {
return null;
}
}
public boolean hasNext() {
while (!tokenizer.hasMoreTokens()) {
String s = nextLine();
if (s == null)
return false;
eat(s);
}
return true;
}
public String next() {
hasNext();
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public BigInteger nextBigInteger() {
return new BigInteger(next());
}
}