import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;

class Edge {
	int src,dst,cst;
	public Edge(int src_,int dst_,int cst_) {
		src=src_;
		dst=dst_;
		cst=cst_;
	}
}

public class Main {

	public static void main(String[] args) {
		new Main().run();
	}
	
	long[] dijk(int src,ArrayList<Edge>[] g) {
		int N=g.length;
		long INF=Long.MAX_VALUE/3;
		long[] dist=new long[N];
		Arrays.fill(dist, INF);
		dist[src]=0;
		class State implements Comparable<State>{
			int v;
			long d;
			public State(int v_, long d_) {
				v=v_;d=d_;
			}
			public int compareTo(State o) {return Long.compare(d, o.d);};
		}
		PriorityQueue<State> pq=new PriorityQueue<>();
		pq.add(new State(src,0));
		while(!pq.isEmpty()) {
			State state=pq.poll();
			if(state.d>dist[state.v]) continue;
			for(Edge e:g[state.v]) {
				if(dist[state.v]+e.cst<dist[e.dst]) { 
					dist[e.dst]=dist[state.v]+e.cst;
					pq.add(new State(e.dst,dist[e.dst]));
				}
			}
		}
		return dist;
	}
	
	
	
	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		int M=sc.nextInt();
		int L=sc.nextInt()-1;
		int[] t=new int[N];
		for(int i=0;i<N;++i) t[i]=sc.nextInt();
		ArrayList<Edge>[] g=new ArrayList[N];
		for(int i=0;i<N;++i) g[i]=new ArrayList<>();
		for(int i=0;i<M;++i) {
			int a=sc.nextInt()-1;
			int b=sc.nextInt()-1;
			int c=sc.nextInt();
			g[a].add(new Edge(a,b,c));
			g[b].add(new Edge(b,a,c));
		}

		if(Arrays.stream(t).max().getAsInt()==Arrays.stream(t).sum()) {
			System.out.println(0);
			return;
		}
		
		long ans=Long.MAX_VALUE/3;
		for(int dst=0;dst<N;++dst) {
			long sum=0;
			long[] dist=dijk(dst, g);
			for(int i=0;i<N;++i) {
				sum+=2*dist[i];
			}
			ans=Math.min(ans,sum-dist[L]);
		}
		System.out.println(ans);
	}
	
	
	void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    
    public double nextDouble() { return Double.parseDouble(next());}
}