import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static IO io = new IO();
	static int INF = 1 << 29;
	public static void main(String[] args) {
		while(solve());
		io.flush();
	}
	
	public static boolean solve() {
		int n = io.nextInt();
		int m = io.nextInt();
		if (n == 0) return false;
		
		int[][] distLand = new int[n][n];
		int[][] distSea  = new int[n][n];
		for(int i=0;i<n;i++) {
			for(int j=0;j<n;j++) {
				if (i != j) distLand[i][j] = distSea[i][j] = INF;
			}
		}
		for(int i=0;i<m;i++) {
			int x = io.nextInt() - 1;
			int y = io.nextInt() - 1;
			int t = io.nextInt();
			char sl = io.nextChar();
			if (sl == 'L') {
				distLand[x][y] = Math.min(distLand[x][y], t);
				distLand[y][x] = Math.min(distLand[y][x], t);
			}else{
				distSea[x][y] = Math.min(distSea[x][y], t);
				distSea[y][x] = Math.min(distSea[y][x], t);
			}
		}
		for(int k=0;k<n;k++) {
			for(int i=0;i<n;i++) {
				for(int j=0;j<n;j++) {
					distLand[i][j] = Math.min(distLand[i][j], distLand[i][k] + distLand[k][j]);
					distSea[i][j] = Math.min(distSea[i][j], distSea[i][k] + distSea[k][j]);
				}
			}
		}
		int r = io.nextInt();
		int[] z = new int[r];
		for(int i=0;i<r;i++) {
			z[i] = io.nextInt() - 1;
		}
		int[][] dp = new int[r][n];
		for(int i=0;i<r;i++) {
			Arrays.fill(dp[i], INF);
		}
		dp[0][z[0]] = 0;
		for(int i=0;i<r-1;i++) {
			for(int j=0;j<n;j++) {
				if (dp[i][j] == INF) continue;
				for(int k=0;k<n;k++) {
					if (j == k) {
//						System.out.println(i + ":" + j + "->" + k + ":" + (distLand[z[i]][z[i+1]]));
						dp[i+1][k] = Math.min(dp[i+1][k], dp[i][j] + distLand[z[i]][z[i+1]]);
					}else{
//						System.out.println(i + ":" + j + "->" + k + ":" + (distLand[z[i]][j] + distSea[j][k] + distLand[k][z[i+1]]));
						dp[i+1][k] = Math.min(dp[i+1][k], dp[i][j] + distLand[z[i]][j] + distSea[j][k] + distLand[k][z[i+1]]);
					}
				}
			}
		}
		int ans = INF;
		for(int i=0;i<n;i++) {
			ans = Math.min(ans, dp[r-1][i]);
		}
		io.println(ans);
		
		return true;
	}

}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	
	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	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;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(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 char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(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 char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}

Measured memory_bytes: 48796