# include<iostream>
# include<cstdio>
# include<vector>
# include<queue>
# include<cstring>
# include<iostream>
using namespace std;const int INF=1<<30;
const int maxn=2505;int n,m;
char p[60][60];struct Edge
{int fr,to,cap,fw;Edge(int fr,int to,int cap,int fw){this->fr=fr;this->to=to;this->cap=cap;this->fw=fw;}
};
struct ISAP
{vector<Edge>edges;vector<int>G[maxn];int d[maxn],gap[maxn],p[maxn];int n,s,t,vis[maxn],cur[maxn];void init(int n){this->n=n;edges.clear();for(int i=0;i<n;++i) G[i].clear();}void addEdge(int u,int v,int cap){edges.push_back(Edge(u,v,cap,0));edges.push_back(Edge(v,u,0,0));int m=edges.size();G[u].push_back(m-2);G[v].push_back(m-1);}void bfs(int u){memset(vis,0,sizeof(vis));d[u]=0;queue<int>q;q.push(u);vis[u]=1;while(!q.empty()){int x=q.front();q.pop();for(int i=0;i<G[x].size();++i){Edge &e=edges[G[x][i]];if(e.cap>0) continue;int v=edges[G[x][i]^1].fr;if(!vis[v]){vis[v]=1;d[v]=d[x]+1;q.push(v);}}}}int augment(){int a=INF;for(int u=t;u!=s;u=edges[p[u]].fr){Edge &e=edges[p[u]];a=min(a,e.cap-e.fw);}for(int u=t;u!=s;u=edges[p[u]].fr){edges[p[u]].fw+=a;edges[p[u]^1].fw-=a;}return a;}int maxFlow(int s,int t){this->s=s,this->t=t;bfs(t);int flow=0;memset(gap,0,sizeof(gap));for(int i=0;i<n;++i) ++gap[d[i]];memset(cur,0,sizeof(cur));int x=s;while(d[s]<n){if(x==t){flow+=augment();x=s;}int flag=false;for(int i=cur[x];i<G[x].size();++i){Edge &e=edges[G[x][i]];if(e.cap>e.fw&&d[x]==d[e.to]+1){flag=true;p[e.to]=G[x][i];cur[x]=i;x=e.to;break;}}if(!flag){int m=n-1;for(int i=0;i<G[x].size();++i){Edge &e=edges[G[x][i]];if(e.cap>e.fw) m=min(m,d[e.to]);}if((--gap[d[x]])==0) break;d[x]=m+1;++gap[d[x]];cur[x]=0;if(x!=s) x=edges[p[x]].fr;}}return flow;}
};
ISAP solver;int d,f,b;
int dd[4][2]={{-1,0},{1,0},{0,-1},{0,1}};bool ok(int x,int y)
{return x>=1&&x<=n&&y>=1&&y<=m;
}int main()
{int T;scanf("%d",&T);while(T--){int cnt=0;scanf("%d%d",&m,&n);scanf("%d%d%d",&d,&f,&b);for(int i=1;i<=n;++i){scanf("%s",p[i]+1);if(p[i][1]=='.'){++cnt;p[i][1]='#';}if(m>1&&p[i][m]=='.'){++cnt;p[i][m]='#';}if(i==1||i==n)for(int j=1;j<=m;++j)if(p[i][j]=='.'){++cnt;p[i][j]='#';}}solver.init(n*m+2);for(int i=1;i<=n;++i){for(int j=1;j<=m;++j){for(int k=0;k<4;++k){int ni=i+dd[k][0],nj=j+dd[k][1];if(ok(ni,nj)) solver.addEdge((i-1)*m+j,(ni-1)*m+nj,b);}if(p[i][j]=='#'){if(i==1||i==n||j==1||j==m)solver.addEdge(0,(i-1)*m+j,INF);elsesolver.addEdge(0,(i-1)*m+j,d);}else{solver.addEdge((i-1)*m+j,n*m+1,f);}}}printf("%d\n",solver.maxFlow(0,n*m+1)+cnt*f);}return 0;
}