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.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Calendar;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.SortedSet;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

/**
 * #
 *
 * @author pttrung
 */
public class D_Avito_2018 {

    public static long MOD = 998244353;
    static long[][] dp;

    public static void main(String[] args) throws FileNotFoundException {
        // PrintWriter out = new PrintWriter(new FileOutputStream(new File(
        // "output.txt")));
        PrintWriter out = new PrintWriter(System.out);
        Scanner in = new Scanner();
        int n = in.nextInt();
        int m = in.nextInt();
        int k = in.nextInt();
        boolean[] special = new boolean[n];
        for (int i = 0; i < k; i++) {
            special[in.nextInt() - 1] = true;
        }
        int[][] edge = new int[m][4];
        ArrayList<Integer>[] map = new ArrayList[n];
        HashSet<Integer>[] nxt = new HashSet[n];
        for (int i = 0; i < n; i++) {
            map[i] = new ArrayList<>();
            nxt[i] = new HashSet<>();
        }
        for (int i = 0; i < m; i++) {
            edge[i][0] = in.nextInt() - 1;
            edge[i][1] = in.nextInt() - 1;
            edge[i][2] = in.nextInt();
            edge[i][3] = i;
            map[edge[i][0]].add(i);
            if (edge[i][0] != edge[i][1]) {
                map[edge[i][1]].add(i);
            }
        }
        PriorityQueue<int[]> q = new PriorityQueue<>((a, b) -> Integer.compare(a[2], b[2]));
        for (int i : map[0]) {
            q.add(edge[i]);
        }
        boolean[]check = new boolean[n];
        check[0] = true;
        while(!q.isEmpty()){
            int[]e = q.poll();
            if(!check[e[0]]){
                check[e[0]] = true;
                nxt[e[0]].add(e[3]);
                nxt[e[1]].add(e[3]);
                for(int i : map[e[0]]){
                    q.add(edge[i]);
                }
            }else if(!check[e[1]]){
                check[e[1]] = true;
                nxt[e[0]].add(e[3]);
                nxt[e[1]].add(e[3]);
                for(int i : map[e[1]]){
                    q.add(edge[i]);
                }
            }
        }
        int[]tmp = new int[n];
        int index = 0;
        for(int i = 0; i < n; i++){
            if(!special[i] && nxt[i].size() == 1){
                tmp[index++] = i;
            }
        }
        for(int i = 0; i < index; i++){
            for(int j : nxt[tmp[i]]){
                int u =  edge[j][0] == tmp[i]? edge[j][1] : edge[j][0];
                nxt[u].remove(j);
                if(nxt[u].size() == 1 && !special[u]){
                    tmp[index++] = u;
                }
            }
        }
        int result = 0;
        for(int i = 0; i < n; i++){
            for(int j : nxt[i]){
                result = Integer.max(result, edge[j][2]);
            }
        }
        for(int i = 0; i < k; i++){
            out.print(result + " ");
        }
        out.close();
    }

    static int find(int index, int[] u) {
        if (u[index] != index) {
            return u[index] = find(u[index], u);
        }
        return index;
    }

    static int count(int last, int cur) {
        if (last == cur) {
            return 0;
        }
        if (last == 0 && cur != 0) {
            return 1;
        }
        if (last == 1) {
            if (cur == 2) {
                return 2;
            }
            return 0;
        }
        if (last == 2) {
            if (cur == 1) {
                return 2;
            }
            return 0;
        }
        return 1;
    }

    public static boolean div(int need, String v) {
        int cur = 0;
        for (int i = 0; i < v.length(); i++) {
            cur += v.charAt(i) - '0';
            if (cur == need) {
                cur = 0;
            } else if (cur > need) {
                return false;
            }
        }
        return true;
    }

    public static int[] KMP(String val) {
        int i = 0;
        int j = -1;
        int[] result = new int[val.length() + 1];
        result[0] = -1;
        while (i < val.length()) {
            while (j >= 0 && val.charAt(j) != val.charAt(i)) {
                j = result[j];
            }
            j++;
            i++;
            result[i] = j;
        }
        return result;

    }

    public static boolean nextPer(int[] data) {
        int i = data.length - 1;
        while (i > 0 && data[i] < data[i - 1]) {
            i--;
        }
        if (i == 0) {
            return false;
        }
        int j = data.length - 1;
        while (data[j] < data[i - 1]) {
            j--;
        }
        int temp = data[i - 1];
        data[i - 1] = data[j];
        data[j] = temp;
        Arrays.sort(data, i, data.length);
        return true;
    }

    public static int digit(long n) {
        int result = 0;
        while (n > 0) {
            n /= 10;
            result++;
        }
        return result;
    }

    public static double dist(long a, long b, long x, long y) {
        double val = (b - a) * (b - a) + (x - y) * (x - y);
        val = Math.sqrt(val);
        double other = x * x + a * a;
        other = Math.sqrt(other);
        return val + other;

    }

    public static class Point implements Comparable<Point> {

        int x, y;

        public Point(int start, int end) {
            this.x = start;
            this.y = end;
        }

        @Override
        public int hashCode() {
            int hash = 5;
            hash = 47 * hash + this.x;
            hash = 47 * hash + this.y;
            return hash;
        }

        @Override
        public boolean equals(Object obj) {
            if (obj == null) {
                return false;
            }
            if (getClass() != obj.getClass()) {
                return false;
            }
            final Point other = (Point) obj;
            if (this.x != other.x) {
                return false;
            }
            if (this.y != other.y) {
                return false;
            }
            return true;
        }

        @Override
        public int compareTo(Point o) {
            return Integer.compare(x, o.x);
        }
    }

    public static class FT {

        long[] data;

        FT(int n) {
            data = new long[n];
        }

        public void update(int index, long value) {
            while (index < data.length) {
                data[index] += value;
                index += (index & (-index));
            }
        }

        public long get(int index) {
            long result = 0;
            while (index > 0) {
                result += data[index];
                index -= (index & (-index));
            }
            return result;

        }
    }

    public static long gcd(long a, long b) {
        if (b == 0) {
            return a;
        }
        return gcd(b, a % b);
    }

    public static long pow(long a, long b, long MOD) {
        if (b == 0) {
            return 1;
        }
        if (b == 1) {
            return a;
        }
        long val = pow(a, b / 2, MOD);
        if (b % 2 == 0) {
            return val * val % MOD;
        } else {
            return val * (val * a % MOD) % MOD;

        }
    }

    static class Scanner {

        BufferedReader br;
        StringTokenizer st;

        public Scanner() throws FileNotFoundException {
            // System.setOut(new PrintStream(new BufferedOutputStream(System.out), true));
            br = new BufferedReader(new InputStreamReader(System.in));
            //  br = new BufferedReader(new InputStreamReader(new FileInputStream(new File("input.txt"))));
        }

        public String next() {

            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    throw new RuntimeException();
                }
            }
            return st.nextToken();
        }

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

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

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

        public String nextLine() {
            st = null;
            try {
                return br.readLine();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }

        public boolean endLine() {
            try {
                String next = br.readLine();
                while (next != null && next.trim().isEmpty()) {
                    next = br.readLine();
                }
                if (next == null) {
                    return true;
                }
                st = new StringTokenizer(next);
                return st.hasMoreTokens();
            } catch (Exception e) {
                throw new RuntimeException();
            }
        }
    }
}