#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s; }



template<class T> struct Edge {
    int from, to;
    T cost;
    Edge(int f, int t, T c) : from(f), to(t), cost(c) {}
    friend bool operator < (const Edge &e1, const Edge &e2) {return e1.cost < e2.cost;}
    friend bool operator > (const Edge &e1, const Edge &e2) {return e1.cost > e2.cost;}
    friend ostream& operator << (ostream& s, const Edge<T>& E) {
        return s << E.from << "->" << E.to << '(' << E.cost << ')';
    }
};

const int MAX_V = 3300;
template<class T> struct Graph {
    int V;
    vector<Edge<T> > list[MAX_V];
    
    Graph(int n = 0) : V(n) {}
    void init(int n = 0) {V = n; for (int i = 0; i < MAX_V; ++i) list[i].clear();}
    inline vector<Edge<T> >& operator [] (int i) {return list[i];}
    
    void connect(int f, int t, T c) {
        list[f].push_back(Edge<T>(f,t,c));
        list[t].push_back(Edge<T>(t,f,c));
    }
    
    friend ostream& operator << (ostream& s, const Graph& G) {
        s << endl; for (int i = 0; i < G.V; ++i) {s << i << " : " << G.list[i] << endl;}return s;
    }
};

Graph<int> G;



int V, E, K;
int a, b, w;

const int INF = 1<<29;
int dist[MAX_V];

int main() {
    while (cin >> V >> E >> K) {
        int s = 0;
        G.init(V+1);
        for (int i = 0; i < E; ++i) {
            cin >> a >> b >> w;
            G.connect(a, b, w);
        }
        for (int i = 0; i < K; ++i) {
            cin >> a;
            G.connect(s, a, 0);
        }
        
        for (int i = 0; i < MAX_V; ++i) dist[i] = INF;
        dist[s] = 0;
        priority_queue< pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > > que;
        que.push( pint(0,s) );
        
        while (!que.empty()) {
            pint pp = que.top(); que.pop();
            int v = pp.second, d = pp.first;
            
            if (dist[v] > d) continue;
            for (int i = 0; i < G[v].size(); ++i) {
                int to = G[v][i].to;
                if ( chmin(dist[to], dist[v] + G[v][i].cost) ) {
                    que.push( pint(dist[to], to) );
                }
            }
        }
        
        int res = -1;
        for (int i = 1; i <= V; ++i) {
            for (int j = 0; j < G[i].size(); ++j) {
                int a = i, b = G[i][j].to;
                int tmp = (dist[a] + dist[b] + G[i][j].cost + 1) / 2;
                chmax(res, tmp);
            }
        }
        
        cout << res << endl;
    }
    return 0;
}


Measured memory_bytes: 5656