#include <bits/stdc++.h>
using namespace std;
int grid[105][105],num[105][105];
int n,m;
pair<int,int> check(int x, int y){
	pair<int,int> ret={-1,-1};
	for(int i=0; i<2; i++) for(int j=0; j<2; j++){
		if(grid[x+i][y+j]==0){
			ret={x+i,y+j};
			break;
		}
	}
	if(grid[x][y]!=grid[x+1][y]&&grid[x][y]!=grid[x][y+1]){
		if(grid[x][y+1]!=grid[x+1][y+1]&&grid[x+1][y]!=grid[x+1][y+1]){
			return ret;
		}
	}
	return {-1,-1};
}
void dfs(int x, int y, int v){
	grid[x][y]=v;
	num[x-1][y-1]--; num[x-1][y]--; num[x][y-1]--; num[x][y]--;
	pair<int,int> yey;
	if(num[x-1][y-1]==1){
		yey=check(x-1,y-1);
		if(yey.first!=-1){
			if(yey.first<x) dfs(yey.first,yey.second,grid[yey.first+1][yey.second]);
			else dfs(yey.first,yey.second,grid[yey.first][yey.second+1]);
		}
	}
	if(num[x-1][y]==1){
		yey=check(x-1,y);
		if(yey.first!=-1){
			if(yey.first<x) dfs(yey.first,yey.second,grid[yey.first+1][yey.second]);
			else dfs(yey.first,yey.second,grid[yey.first][yey.second-1]);
		}
	}
	if(num[x][y-1]==1){
		yey=check(x,y-1);
		if(yey.first!=-1){
			if(yey.first>x) dfs(yey.first,yey.second,grid[yey.first-1][yey.second]);
			else dfs(yey.first,yey.second,grid[yey.first][yey.second+1]);
		}
	}
	if(num[x][y]==1){
		yey=check(x,y);
		if(yey.first!=-1){
			if(yey.first>x) dfs(yey.first,yey.second,grid[yey.first-1][yey.second]);
			else dfs(yey.first,yey.second,grid[yey.first][yey.second-1]);
		}
	}
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--){
		cin >> n >> m;
		for(int i=1; i<=n; i++){
			for(int j=1; j<=m; j++){
				char c;
				cin >> c;
				if(c=='B') grid[i][j]=1;
				else if(c=='W') grid[i][j]=2;
				else grid[i][j]=0;
			}
		}
		for(int i=1; i<n; i++){
			for(int j=1; j<m; j++){
				for(int a=0; a<2; a++){
					for(int b=0; b<2; b++){
						if(grid[i+a][j+b]==0) num[i][j]++;
					}
				}
			}
		}
		for(int i=1; i<n; i++){
			for(int j=1; j<m; j++){
				if(num[i][j]==1){
					pair<int,int> yey=check(i,j);
					if(yey.first!=-1){
						if(yey.first>i) dfs(yey.first,yey.second,grid[yey.first-1][yey.second]);
						else dfs(yey.first,yey.second,grid[yey.first+1][yey.second]);
					}
				}
			}
		}
		for(int i=1; i<=n; i++){
			for(int j=1; j<=m; j++){
				if(grid[i][j]==0) dfs(i,j,1);
			}
		}
		bool can=true;
		for(int i=1; i<n; i++){
			for(int j=1; j<m; j++){
				if(grid[i][j]!=grid[i+1][j]&&grid[i][j]!=grid[i][j+1]){
					if(grid[i+1][j]!=grid[i+1][j+1]&&grid[i][j+1]!=grid[i+1][j+1]){
						can=false;
					}
				}
			}
		}
		cout << (can?"YES\n":"NO\n");
		if(can){
			for(int i=1; i<=n; i++){
				for(int j=1; j<=m; j++){
					if(grid[i][j]==1) cout << 'B';
					else cout << 'W';
				}
				cout << '\n';
			}
		}
		for(int i=0; i<=n; i++){
			for(int j=0; j<=m; j++) grid[i][j]=0,num[i][j]=0;
		}
	}
    return 0;
}