import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.*;
/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Manan Patel
 */
public class Main{
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter w = new PrintWriter(outputStream);
        Solution solver = new Solution();
        int testCount = Integer.parseInt(in.next());
        for (int i = 1; i <= testCount; i++)
            solver.solve(1 , in, w);
        w.close();
    }

    static class Solution {
        char c[][];
        boolean vis[][];
        int X[] = {0 , 0 , -1 , 1};
        int Y[] = {1 , -1 , 0 , 0};
        int n  , m;
        public void check(int i , int j){
            for (int k = 0 ; k < 4 ; k++){
                int x = i + X[k];
                int y = j + Y[k];
                if(x < n && x >= 0 && y < n && y >= 0 && c[x][y] == '.')
                    c[x][y] = '#';
            }
        }
        public boolean dfs(int i , int j){
            if (i < 0 || i >= n || j < 0 || j >= m || c[i][j] == '#' || vis[i][j])
                return false;
            
            if (i == n - 1 && j == m - 1)
                return true;
            
            vis[i][j] = true;
            boolean ok = false;
            
            for (int k = 0 ; k < 4 ; k++)
                ok |= dfs(i + X[k] , j + Y[k]);
            
            return ok;
        }
        public void solve(int tc, InputReader sc, PrintWriter w) {
            n = sc.nextInt();
            m = sc.nextInt();
            c = new char[n][m];
            vis = new boolean[n][m];
            for (int i = 0 ; i < n ; i++){
                c[i] = sc.next().toCharArray();
            }
            
            for (int i = 0 ; i < n ; i++){
                for (int j = 0 ; j < m ; j++){
                    if(c[i][j] == 'B'){
                        check(i , j);
                    }
                }
            }
            
            for (int i = 0 ; i < n ; i++){
                for (int j = 0 ; j < m ; j++){
                    if (vis[i][j]) continue;
                    if(c[i][j] == 'B'){
                        if(dfs(i , j)){
                            w.println("No");
                            return;
                        }
                    }
                }
            }
            
            for (int i = 0 ; i < n ; i++)
                for (int j = 0 ;  j < m ; j++)
                    vis[i][j] = false;
                
            for (int i = 0 ; i < n ; i++){
                for (int j = 0 ; j < m ; j++){
                    if (vis[i][j]) continue;
                    if(c[i][j] == 'G'){
                        if(!dfs(i , j)){
                            w.println("No");
                            return;
                        }
                    }
                }
            }
            
            w.println("Yes");
        }
    }
    static class f{
        public static long power(long x, int y){
            long res = 1;
            while (y > 0)
            {
                if ((y & 1) == 1)
                    res = (res*x);
                y = y >> 1;
                x = x * x;
            }
            return res;
        }
        public static long powerm(long x, long y, long p) {
            long res = 1;
            x %= p;
            while (y > 0) {
                if ((y & 1) == 1) {
                    res *= x;
                    res %= p;
                }
                y >>= 1;
                x *= x;
                x %= p;
            }
            return res;
        }
        public static void sort(int[] arr) {
            int n = arr.length, mid, h, s, l, i, j, k;
            int[] res = new int[n];
            for (s = 1; s < n; s <<= 1) {
                for (l = 0; l < n - 1; l += (s << 1)) {
                    h = Math.min(l + (s << 1) - 1, n - 1);
                    mid = Math.min(l + s - 1, n - 1);
                    i = l;
                    j = mid + 1;
                    k = l;
                    while (i <= mid && j <= h)
                        res[k++] = (arr[i] <= arr[j] ? arr[i++] : arr[j++]);
                    while (i <= mid)
                        res[k++] = arr[i++];
                    while (j <= h)
                        res[k++] = arr[j++];
                    for (k = l; k <= h; k++)
                        arr[k] = res[k];
                }
            }
        }
        public static long gcd(long a, long b)
        {
            if (a == 0)
                return b;
            return gcd(b % a, a);
        }

        public static long findGCD(long arr[], int n)
        {
            long result = arr[0];
            for (int i = 1; i < n; i++)
                result = gcd(arr[i], result);
            return result;
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new InputMismatchException();

            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }

                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();

            while (isSpaceChar(c))
                c = read();

            int sgn = 1;

            if (c == '-') {
                sgn = -1;
                c = read();
            }

            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));

            return res * sgn;
        }

        public long nextLong() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;

            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));
            return res * sgn;
        }

        public String readString() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            }
            while (!isSpaceChar(c));

            return res.toString();
        }

        public boolean isSpaceChar(int c) {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public String next() {
            return readString();
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

}
