Chouti was tired of the tedious homework, so he opened up an old programming problem he created years ago.

You are given a connected undirected graph with n vertices and m weighted edges. There are k special vertices: x_1, x_2, …, x_k.

Let's define the cost of the path as the maximum weight of the edges in it. And the distance between two vertexes as the minimum cost of the paths connecting them.

For each special vertex, find another special vertex which is farthest from it (in terms of the previous paragraph, i.e. the corresponding distance is maximum possible) and output the distance between them.

The original constraints are really small so he thought the problem was boring. Now, he raises the constraints and hopes you can solve it for him.

Input

The first line contains three integers n, m and k (2 ≤ k ≤ n ≤ 10^5, n-1 ≤ m ≤ 10^5) — the number of vertices, the number of edges and the number of special vertices.

The second line contains k distinct integers x_1, x_2, …, x_k (1 ≤ x_i ≤ n).

Each of the following m lines contains three integers u, v and w (1 ≤ u,v ≤ n, 1 ≤ w ≤ 10^9), denoting there is an edge between u and v of weight w. The given graph is undirected, so an edge (u, v) can be used in the both directions.

The graph may have multiple edges and self-loops.

It is guaranteed, that the graph is connected.

Output

The first and only line should contain k integers. The i-th integer is the distance between x_i and the farthest special vertex from it.

Examples

Input

2 3 2
2 1
1 2 3
1 2 2
2 2 1


Output

2 2 


Input

4 5 3
1 2 3
1 2 5
4 2 1
2 3 2
1 4 4
1 3 3


Output

3 3 3 

Note

In the first example, the distance between vertex 1 and 2 equals to 2 because one can walk through the edge of weight 2 connecting them. So the distance to the farthest node for both 1 and 2 equals to 2.

In the second example, one can find that distance between 1 and 2, distance between 1 and 3 are both 3 and the distance between 2 and 3 is 2.

The graph may have multiple edges between and self-loops, as in the first example.
4 4 3
1 2 3
1 2 1
2 3 2
1 3 3
1 4 4
 4 3 2
1 4
1 2 1
2 3 5
3 4 1
 3 2 2
1 2
1 2 1
2 3 47
 3 2 2
1 2
1 2 1
2 3 1000
 3 2 2
1 2
1 2 10
2 3 100
 3 3 2
2 3
1 2 100
1 3 100
2 3 1
 3 2 2
1 2
1 2 2
2 3 3
 6 5 3
1 2 4
1 3 3
3 2 2
2 4 1
3 5 4
5 6 10
 3 2 2
2 3
1 2 10
2 3 1
 3 2 2
1 2
1 2 1
2 3 4
 6 5 2
1 6
1 2 1
2 3 2
3 4 3
4 5 2
5 6 1
 5 4 2
4 5
1 2 100
2 3 100
3 4 10
3 5 20
 4 3 3
1 2 3
1 2 5
1 3 4
1 4 5
 4 4 3
1 2 3
1 2 1
1 3 2
2 3 3
3 4 5
 2 2 2
1 2
1 2 3
1 2 5
 3 2 2
1 2
1 2 1
2 3 100
 3 3 2
1 2
1 2 1
2 3 4
1 3 5
 3 2 2
2 3
1 2 3
2 3 1
 5 4 2
4 5
1 2 10
2 3 10
3 4 1
4 5 1
 4 3 2
1 4
1 2 4
2 3 6
3 4 4
 4 3 2
1 2
1 2 1
2 3 23
3 4 1231
 3 2 2
1 2
1 2 3
2 3 5
 5 4 2
1 5
1 2 1
1 3 2
2 4 5
3 5 3
 3 4 2
2 1
1 2 3
1 2 2
2 2 1
1 3 99
 4 3 2
1 2
1 2 1
2 3 123
3 4 12321
 4 3 3
1 2 3
1 2 6
1 3 7
1 4 10
 4 5 2
2 3
1 2 5
4 2 1
2 3 2
1 4 4
1 3 3
 3 2 2
1 2
1 2 1
2 3 5
 3 2 2
1 2
1 2 1
2 3 2
 3 2 2
1 2
3 2 10
2 1 1
 4 3 2
3 4
1 2 2
1 3 4
3 4 1
 3 2 2
1 3
1 2 1
2 3 1
 5 5 2
1 2
1 2 1
2 3 2
3 4 2
4 5 2
5 1 2
 5 4 3
1 2 4
1 2 10
2 3 100
2 4 20
5 3 1000
 4 3 2
3 4
1 2 9
2 3 6
3 4 1
 3 2 2
1 2
1 2 10
3 2 20
 5 4 2
4 5
1 2 100
2 3 100
3 4 100
4 5 1
 3 2 2
3 2
1 2 233
2 3 3
 4 3 2
1 4
1 2 1
2 3 3
3 4 1
 2 1 2
1 2
1 2 1000000000
 5 7 4
1 2 3 4
1 2 3
5 1 4
3 1 1
4 2 5
2 5 6
2 3 3
3 4 6
 4 3 2
1 2
1 2 1
2 3 2
3 4 1
 3 2 2
2 3
1 2 1000
2 3 1
 4 3 2
3 4
1 2 10000
2 3 10000
3 4 1
 7 6 2
6 7
1 2 1
2 3 1
3 4 1
4 5 1
5 6 1
6 7 1
 3 2 2
2 3
1 2 100
2 3 1
 4 3 2
1 2
1 2 1
2 3 12
3 4 123123
 3 2 2
2 1
1 2 1
2 3 100
 3 2 2
2 3
1 2 2
2 3 1
 3 2 2
2 3
1 2 7
2 3 1
 3 2 2
1 2
1 2 1
2 3 3
 3 2 2
1 2
1 2 10
2 3 15
 4 3 2
1 4
1 2 3
2 3 4
3 4 3
 6 5 4
1 2 3 4
1 2 1
2 3 1
3 4 1
4 5 1
5 6 10
 4 3 2
2 3
1 2 1000
2 3 1
3 4 1000
 4 3 2
1 2
1 2 1
2 3 1000
3 4 1000
 3 3 2
1 2
1 2 1
1 3 1000
2 3 1000
 3 2 2
1 2
1 2 3
1 3 5
 4 4 2
3 4
1 2 1000000000
2 3 1000000000
3 1 1000000000
3 4 1
 4 3 2
3 4
1 2 5
2 3 3
2 4 4
 3 2 2
1 2
1 2 3
2 3 100
 3 2 2
2 3
1 2 5
2 3 1
 5 4 2
4 5
1 2 10
2 3 10
3 4 1
3 5 1
 4 3 2
2 3
1 2 100
2 3 1
3 4 100
 4 3 3
1 2 3
1 2 1
3 1 2
4 3 3
 4 3 2
3 4
1 2 100
2 3 2
2 4 2

2 2 2  5 5  1 1  1 1  10 10  1 1  2 2  3 3 3  1 1  1 1  3 3  20 20  5 5 5  2 2 2  3 3  1 1  1 1  1 1  1 1  6 6  1 1  3 3  3 3  2 2  1 1  7 7 7  2 2  1 1  1 1  1 1  1 1  1 1  1 1  20 20 20  1 1  10 10  1 1  3 3  3 3  1000000000 1000000000  5 5 5 5  1 1  1 1  1 1  1 1  1 1  1 1  1 1  1 1  1 1  1 1  10 10  4 4  1 1 1 1  1 1  1 1  1 1  3 3  1 1  4 4  3 3  1 1  1 1  1 1  2 2 2  2 2 
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;


public class Main {

	static class Task {
		
		int NN = 100005;
		int MOD = 998244353;
		int INF = 2000000000;
		
		class Pair{
			int x;
			int y;
			public Pair(int x, int y) {
				this.x = x;this.y = y;
			}
			@Override
			public int hashCode() {
				final int prime = 31;
				int result = 1;
				result = prime * result + getOuterType().hashCode();
				result = prime * result + x;
				result = prime * result + y;
				return result;
			}
			@Override
			public boolean equals(Object obj) {
				if (this == obj)
					return true;
				if (obj == null)
					return false;
				if (getClass() != obj.getClass())
					return false;
				Pair other = (Pair) obj;
				if (!getOuterType().equals(other.getOuterType()))
					return false;
				if (x != other.x)
					return false;
				if (y != other.y)
					return false;
				return true;
			}
			private Task getOuterType() {
				return Task.this;
			}
			
		}
		
		class Edge{
			int node;
			int cost;
			public Edge(int node, int cost) {
				this.node = node;
				this.cost = cost;
			}
		}
		
		List<Edge> [] G = new LinkedList[NN];
		int [] dist = new int[NN];
		boolean [] asked = new boolean[NN];
		
		public void solve(InputReader in, PrintWriter out) {
			int n = in.nextInt(), m = in.nextInt(), k = in.nextInt();
			for(int i=1;i<=n;++i) {
				asked[i] = false;
			}
			for(int i=1;i<=k;++i) {
				int x = in.nextInt();
				asked[x] = true;
			}
			Map<Pair, Integer> cost = new HashMap<>();
			for(int i=1;i<=m;++i) {
				int u = in.nextInt(), v = in.nextInt(), w = in.nextInt();
				if(u == v) {
					continue;
				}
				if(u > v) {
					int t = u;u= v;v = t;
				}
				if(cost.containsKey(new Pair(u, v))) {
					if(cost.get(new Pair(u, v))  > w) {
						cost.put(new Pair(u, v), w);
					}
				} else {
					cost.put(new Pair(u, v), w);
				}
			}
			
			for(Pair key: cost.keySet()) {
				int u = key.x;
				int v = key.y;
				int w = cost.get(key);
				if(G[u] == null) {
					G[u] = new LinkedList<>();
				}
				if(G[v] == null) {
					G[v] = new LinkedList<>();
				}
				G[u].add(new Edge(v, w));
				G[v].add(new Edge(u, w));
			}
			int ans = dijkstra(n);
			for(int i=1;i<=k;++i) {
				out.print(ans + " ");
			}
			out.println("");
		}
	
		int dijkstra(int n) {
			int source = 1;
			for(int i=1;i<=n;++i) {
				dist[i] = INF;
				if(asked[i]) {
					source = i;
				}
			}
			dist[source] = 0;
			TreeSet<Integer> Q = new TreeSet<>(
					(i, j)->Integer.valueOf(dist[i])
					.compareTo(Integer.valueOf(dist[j])));
			Q.add(source);
			Set<Integer> ss= new HashSet<>();
			while(!Q.isEmpty()) {
				int node = Q.first();Q.remove(node);
				if(n == 20000) {
					if(dist[node]==INF)
						ss.add(dist[node]);
				}
				for(Edge adjEdge: G[node]) {
					int adj = adjEdge.node;
					int cost = adjEdge.cost;
					if(Math.max(dist[node], cost) < dist[adj]) {
						Q.remove(adj);
						dist[adj] = Math.max(dist[node], cost);
						Q.add(adj);
					}
				}
			}
			int max = 0;
			for(int i=1;i<=n;++i) {
				if(!asked[i]) {
					continue;
				}
				max = Math.max(max, dist[i]);
			}
			return max;
		}
		
	}
	
	static void prepareIO(boolean isFileIO) {
		Task solver = new Task();
		// Standard IO
		if(!isFileIO) {
			InputStream inputStream = System.in;
	        OutputStream outputStream = System.out;
	        InputReader in = new InputReader(inputStream);
	        PrintWriter out = new PrintWriter(outputStream);
	        solver.solve(in, out);
	        out.close();
		}
        // File IO
		else {
			String IPfilePath = System.getProperty("user.home") + "/Downloads/ip.in";
	        String OPfilePath = System.getProperty("user.home") + "/Downloads/op.out";
	        InputReader fin = new InputReader(IPfilePath);
	        PrintWriter fout = null;
	        try {
				fout = new PrintWriter(new File(OPfilePath));
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
	        solver.solve(fin, fout);
	        fout.close();
		}
	}
	
	public static void main(String[] args) {
        prepareIO(false);
	}
	
	static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
        
        public InputReader(String filePath) {
        	File file = new File(filePath);
            try {
				reader = new BufferedReader(new FileReader(file));
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
            tokenizer = null;
        }
        
        public String nextLine() {
        	String str = "";
        	try {
				str = reader.readLine();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
        	return str;
        }
        
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
        	return Double.parseDouble(next());
        }
        
    }

}