#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#define ll long long
#define inf 0x3f3f3f3f
#define mod 1000000007
#define maxn 200010
inline ll read()
{ll x=0; char c=getchar(),f=1;for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';return x*f;
}
inline void write(ll x)
{static int buf[20],len; len=0;if(x<0)x=-x,putchar('-');for(;x;x/=10)buf[len++]=x%10;if(!len)putchar('0');else while(len)putchar(buf[--len]+'0');
}
inline void writeln(ll x){write(x); putchar('\n');}
inline void writesp(ll x){write(x); putchar(' ');}
struct edge{int to,nxt;
};
struct Graph{edge e[4*maxn];int fir[2*maxn],deg[2*maxn];int tot;inline void clear(){memset(fir,255,sizeof(fir)); tot=0;memset(deg,0,sizeof(deg));}inline void add_edge(int x,int y){e[tot].to=y; e[tot].nxt=fir[x]; fir[x]=tot++;++deg[x];}
}G,T;
int dfn[maxn],low[maxn],st[maxn],ans[maxn];
int val[2*maxn],size[2*maxn],fa[2*maxn],rt[2*maxn];
char s[maxn];
int n,m,tot,tp,cnt;
inline ll power(ll a,ll b)
{ll ans=1;for(;b;b>>=1,a=a*a%mod)if(b&1)ans=ans*a%mod;return ans;
}
void tarjan(int now,int last)
{dfn[now]=low[now]=++tot; st[++tp]=now;for(int i=G.fir[now];~i;i=G.e[i].nxt)if(i!=(last^1)){if(!dfn[G.e[i].to]){tarjan(G.e[i].to,i);low[now]=std::min(low[now],low[G.e[i].to]);if(low[G.e[i].to]>=dfn[now]){++cnt;T.add_edge(now,cnt); T.add_edge(cnt,now);do{T.add_edge(st[tp],cnt); T.add_edge(cnt,st[tp]);}while(st[tp--]!=G.e[i].to);}}else low[now]=std::min(low[now],dfn[G.e[i].to]);}
}
void dfs(int now,int root)
{rt[now]=root;size[now]=val[now];for(int i=T.fir[now];~i;i=T.e[i].nxt)if(T.e[i].to!=fa[now]){fa[T.e[i].to]=now;dfs(T.e[i].to,root);size[now]+=size[T.e[i].to];}
}
void work()
{n=read(); m=read();G.clear();for(int i=1;i<=m;i++){int x=read(),y=read();G.add_edge(x,y); G.add_edge(y,x);}scanf("%s",s);memset(val,0,sizeof(val));for(int i=1;i<=n;i++)val[i]=(s[i-1]=='1');T.clear();memset(dfn,0,sizeof(dfn));memset(low,0,sizeof(low));tot=tp=0; cnt=n;for(int i=1;i<=n;i++)if(!dfn[i]){tarjan(i,-1);fa[i]=-1;dfs(i,i);}int odd=0,block=0;for(int i=1;i<=n;i++)if(fa[i]==-1)odd+=(size[i]&1),++block;ans[0]=(odd?0:power(2,m-n+block));for(int i=1;i<=n;i++){odd-=(size[rt[i]]&1);int flag=1;for(int j=T.fir[i];~j;j=T.e[j].nxt)if(T.e[j].to!=fa[i]&&(size[T.e[j].to]&1)){flag=0; break;}if(odd||!flag||((size[rt[i]]-size[i])&1))ans[i]=0;else ans[i]=power(2,(m-G.deg[i])-(n-1)+(block+T.deg[i]-1));odd+=(size[rt[i]]&1);}for(int i=0;i<=n;i++)writesp(ans[i]);putchar('\n');
}
int main()
{int T=read();while(T--)work();return 0;
}