
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <bitset>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#define strtok_r strtok_s
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n)
#define REPEAT(i, k, n)     for(int i = (k); i < ((k)+(n)); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); --i)
#define FROMTO(i,f,t)       for(int i = f; i < t; i++)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define FILL(m,v)           memset(m, v, sizeof(m))
#define mp                  make_pair
#define pb                  push_back
template<class _T> _T MAX(_T p1,_T p2){return (p1>p2)?p1:p2;} 
template<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} 
template <class _Tv> inline string join(const _Tv &v,string sep=" "){
    ostringstream s;FOREACH(it,v){if(it!=v.begin())s<<sep;s<<*it;};return s.str();
}

typedef long long ll;
typedef unsigned long long ull;
typedef double D;
typedef complex<D> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define X real()
#define Y imag()
#define EPS (1e-9)
#define DEQ(p1,p2) (abs((p1)-(p2)) < EPS)

#ifdef _DEBUG
template<class _Tv> inline void _prfe(const char *_n,const _Tv _c,bool _p=false){
    ITER(_c) _it=_c.begin();
    if(_p){cout<<_n<<" = ["<<endl;for(;_it!=_c.end();++_it)cout<<"    "<<*_it<<endl;cout<<"]"<<endl; }
    else{cout<<_n<<" = [ ";if(_c.size()){cout<<*_it++;for(;_it!=_c.end();++_it)cout<<", "<<*_it;}cout<<" ]"<<endl; }
}
ostream &operator<<(ostream &os, const pair<int,int> &p){return(os<<"("<<p.first<<","<<p.second<<")");}
#define pf printf
#define pr(n) do{cout<<#n" = "<<(n)<<endl;}while(0)
#define prfe(n) _prfe(#n, n)
#define prfep(n) _prfe(#n, n, true)
#define dbgchk(n) do{if(n)throw;}while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#define prfe(...) /* */
#define prfep(...) /* */
#define dbgchk(...) /* */
#endif

int n,m;
vector<int> vst[15];
int l;
vector<int> vk[15];

struct OP {
    unsigned short op;
    unsigned short val;
    OP(int o, int v){ op=o,val=v; }
};
struct QUE {
    unsigned short pos;
    unsigned short light;
    unsigned int step;
    QUE(int p, int l, int s){ pos=p,light=l,step=s; }
};

vector<OP> memo[15][1<<15];

void result(vector<OP> &op){
    printf("You can go home in %d steps.\n", op.size());
    FOREACH(it, op){
        switch(it->op){
        case 0:
            printf("Switch on room %d.\n", it->val+1);
            break;
        case 1:
            printf("Switch off room %d.\n", it->val+1);
            break;
        case 2:
            printf("Move to room %d.\n", it->val+1);
            break;
        }
    }
}

bool update(int op, int val, vector<OP> &prev, vector<OP> &next, int step){
    int s = next.size();
    if(s == 0 || s > step){
        next = prev;
        next.pb(OP(op,val));
        return true;
    }
    return false;
}

void dfs(deque<QUE> &q, int pos, int light, int step, int idx, vector<int> &vk){
    if(idx == (int)vk.size()){
        FOREACH(it, vst[pos]){
            int &newpos = *it;
            if(((light >> newpos)&1) == 0) continue;
            if(update(2, newpos, memo[pos][light], memo[newpos][light], step+1)){
                q.pb(QUE(newpos, light, step+1));
                pf("update: %d:%d -> %d:%d, %d (moveto %d)\n", pos, light, newpos, light, step+1, newpos);
            }
        }
        return;
    }
    int &k = vk[idx];
    dfs(q, pos, light, step, idx+1, vk);
    if(update(((light>>k)&1), k, memo[pos][light], memo[pos][light^(1<<k)], step+1)){
        pf("update: %d:%d -> %d:%d, %d (sw %d)\n", pos, light, pos, light^(1<<k), step+1, k);
        dfs(q, pos, light^(1<<k), step+1, idx+1, vk);
    }
}

void solve(){
    pr(n); if(n<2||n>15) throw;
    pr(m); if(m<1||m>30) throw;
    pr(l);
    REP(i,n) prfe(vk[i]);
    REP(i,n) REP(j,1<<n) memo[i][j].clear();
    
    int ll = 1 << (n-1);
    if(n == 1){
        result(memo[0][l]);
        return;
    }
    if((l&1) == 0) throw;

    bool exitflag = false;
    deque<QUE> q;
    q.pb(QUE(0,l,0));
    while(!q.empty()){
        QUE qd = q.front(); q.pop_front();
        if(qd.pos == n-1){
            exitflag = true;
        }
        dfs(q, qd.pos, qd.light, qd.step, 0, vk[qd.pos]);
    }
    if(!exitflag){
        printf("Help me!\n");
        return;
    }
    if(memo[n-1][ll].empty()){
        printf("You can not switch off all lights.\n");
        return;
    }
    result(memo[n-1][ll]);
    return;
}

int main(){
    while(cin >> n >> m){
        if(n == 0 && m == 0) break;
        REP(i,n) vst[i].clear();
        REP(i,m){
            int s, t;
            cin >> s >> t;
            vst[s-1].pb(t-1);
            vst[t-1].pb(s-1);
        }
        l = 0;
        REP(i,n){
            int t;
            cin >> t;
            if(t) l |= (1<<i);
        }
        REP(i,n){
            int k, kn;
            cin >> k;
            vk[i].clear();
            REP(j,k){
                cin >> kn;
                vk[i].pb(kn-1);
            }
            sort(ALL(vk[i]), less<int>());
        }
        solve();
    }

    return 0;
}