#include <fstream>
#include <vector>
#define MAXN 2000
#define KMAX 15
using namespace std;

ifstream fin( "ubuntzei.in" );
ofstream fout( "ubuntzei.out" );

struct nod{
    int vecin, cost;
};

vector <nod> graph[MAXN];

int prieteni[MAXN];

struct obj{
    int last, dist;
};
bool operator <( obj a, obj b ) {
  return a.dist > b.dist;
}

priority_queue <obj> pq;

int dijkstra( int nod ){
    pq.push( {})
}

int main(){
    int m, n, k, i, x, y, cost;
    fin >> n >> m >> k;
    prieteni[0] = 0;
    for( i = 1; i <= k; i++ )
        fin >> prieteni[i];
    prieteni[k + 1] = n - 1;

    for( i = 0; i < m; i++ ){
        fin >> x >> y >> cost;
        graph[x - 1].push_back( { y - 1, cost } );
        graph[y - 1].push_back( { x - 1, cost } );
    }



    return 0;
}