#![allow(unused_parens)]
#![allow(unused_imports)]
#![allow(non_upper_case_globals)]



#[allow(unused_macros)]
macro_rules! invec {
    ( $ t : ty ) => {{
        let mut s = String::new();
        match std::io::stdin().read_line(&mut s) {
            Ok(0) => Vec::<$t>::new(),
            Ok(n) => s
                .trim()
                .split_whitespace()
                .map(|s| s.parse::<$t>().unwrap())
                .collect::<Vec<$t>>(),
            Err(_) => Vec::<$t>::new(),
        }
    }};
}

#[allow(unused_macros)]
macro_rules! get {
      ($t:ty) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.trim().parse::<$t>().unwrap()
          }
      };
      ($($t:ty),*) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              let mut iter = line.split_whitespace();
              (
                  $(iter.next().unwrap().parse::<$t>().unwrap(),)*
              )
          }
      };
      ($t:ty; $n:expr) => {
          (0..$n).map(|_|
              get!($t)
          ).collect::<Vec<_>>()
      };
      ($($t:ty),*; $n:expr) => {
          (0..$n).map(|_|
              get!($($t),*)
          ).collect::<Vec<_>>()
      };
      ($t:ty ;;) => {
          {
              let mut line: String = String::new();
              std::io::stdin().read_line(&mut line).unwrap();
              line.split_whitespace()
                  .map(|t| t.parse::<$t>().unwrap())
                  .collect::<Vec<_>>()
          }
      };
      ($t:ty ;; $n:expr) => {
          (0..$n).map(|_| get!($t ;;)).collect::<Vec<_>>()
      };
}

#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let mut s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($next:expr, [$t:tt]) => {
        {
            let len = read_value!($next, usize);
            (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
        }
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

 
#[cfg(debug_assertions)]
macro_rules! mydbg {
    //($arg:expr) => (dbg!($arg))
    //($arg:expr) => (println!("{:?}",$arg));
      ($($a:expr),*) => {
          eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
      }
}
 
 
#[cfg(not(debug_assertions))]
macro_rules! mydbg {
    ($($arg:expr),*) => {};
}

use std::cmp;
use std::collections::HashMap;
use std::io::{self, Write};

#[allow(dead_code)]
static INF_I64 :i64 = 9223372036854775807;
#[allow(dead_code)]
static INF_I32 : i32 = 2147483647;
#[allow(dead_code)]
static INF_USIZE : usize = 7446744073709551615;



fn get_package(time:usize, bflag : bool)->Vec<(usize,usize,usize)>{
    let mut info = vec![];
    let a = get!(usize);
    if a == 0 {
        //info.push(vec![(0,500)]);
        //continue;
        info.push((10000000,0,0));
        
    }
    else{
        let items = get!(usize,usize;a);
        for j in 0..items.len(){
            let tmp = items[j];
            info.push((time,tmp.0-1,tmp.1-1));
        }
    }

    if bflag{
        let b = get!(usize);
        for _ in 0..b{
           let _ = get!(usize);
        }
    }
    return info;

}
fn post(ret:&str,bflag:bool)->bool{
    
    println!("{}",ret);
    io::stdout().flush().unwrap();
    if bflag {
        let verdict = get!(String);
        if verdict == "NG"{
            return false;
        }
        let c = get!(usize);
        for _ in 0..c{
           let _ = get!(usize);
        }
        
    }
    return true;

}



fn main() {


    
    let bflag = false;
    let (n,m) = get!(usize,usize);
    //mydbg!(n,m);
    
    
    let mut edges = get!(usize,usize,usize;m);
    if bflag {
        //let f = get!(i32;n);
        let f = invec!(usize);
    }
    let tmax = get!(usize);
    
    let mut info:Vec<(usize,usize,usize)> = vec![];
    // for i in 0..tmax{
    //     let a = get!(usize);
    //     if a == 0 {
    //         //info.push(vec![(0,500)]);
    //         continue;
    //     }
    //     let items = get!(usize,usize;a);
    //     for j in 0..items.len(){
    //         let tmp = items[j];
    //         info.push((i,tmp.0,tmp.1));
    //     }
        
    // }
    
 
 
    // for i in 0..info.len(){
    //     let a= info[i];
    //     info[i]  = (a.0,a.1-1,a.2-1);
    // }
    

    let mut dp = vec![vec![INF_USIZE;n];n];

    for i in 0..m{
        let e = edges[i];
        dp[e.0-1][e.1-1] = e.2;
        dp[e.1-1][e.0-1] = e.2;
        dp[e.0-1][e.0-1] = 0;
        dp[e.1-1][e.1-1] = 0;
    }

    let mut next = vec![vec![n;n];n];
    for i in 0..n{
        for j in 0..n{
            next[i][j] = j;
        }
    }

    for k in 0..n{
        for i in 0..n{
            for j in 0..n{
                let tmp = dp[i][k]+dp[k][j];
                if tmp < dp[i][j]{
                    dp[i][j] = tmp;
                    next[i][j] = next[i][k];
                }
            }
        }
    }


    let mut maxcost = 0;
    for i in 0..n{
        maxcost = cmp::max(maxcost, dp[i][0]);
    }
    mydbg!(maxcost);
    //mydbg!(dp);
    
    let mut cur = 0;
    let mut ans:Vec<i32> = vec![];
    let mut time = 0;
    let mut used = vec![0;info.len()];
    mydbg!(used.len(),info.len(),next.len(),dp.len());
    let mut package = vec![];
    let mut present = 0;
    
    let mut now = 1;
    let tmp = get_package(0,bflag);
    for i in 0..tmp.len(){
        info.push(tmp[i]);
    }

            
    loop{
        if time >= tmax{
            break;
        }
        
        // for i in cur..info.len(){
        //     if info[i].0 <= time{
        //         package.push(info[i]);
        //     }
        //     else {
        //         cur = i;
        //         break;
        //     }
        // }
        for i in 0..info.len(){
            if info[i].0 == 10000000{
                continue;
            }
            else if info[i].0 == 10000001{
                break;
            }
            package.push(info[i]);
        }
        info =vec![];

        if package.len() == 0 {
            time += 1;
            //ans.push(-1);
            let tmp = post(&"-1",bflag);
            now += 1;
            if now > tmax {
                return;
            }
            if tmp == false {return};
            let tmp = get_package(now,bflag);
            for i in 0..tmp.len(){
                info.push(tmp[i]);
            }
            continue;
        }

        //mydbg!(package);
        mydbg!(package.len());
        //package.reverse();

        loop{
            let mut path = vec![];
            //mydbg!(package.len());
            if false {
                package.sort_by(|x,y|{
                    if dp[present][x.2] > dp[present][y.2]{
                        cmp::Ordering::Less
                    }
                    else if dp[present][x.2] == dp[present][y.2]{
                        cmp::Ordering::Equal
                    }
                    else{
                        cmp::Ordering::Greater
                    }
                });
            }
            if false {
                package.sort_by(|x,y|{
                    let dtx = dp[present][x.2];
                    let dty = dp[present][y.2];
                    let wtx = now + dtx - x.0;
                    let wty = now + dty - y.0;
                    if wtx > wty{
                        cmp::Ordering::Less
                    }
                    else if wtx == wty{
                        cmp::Ordering::Equal
                    }
                    else{
                        cmp::Ordering::Greater
                    }
                });
            }
            let tmp2 = package.iter().take(10).map(|x|{x.clone()}).collect::<Vec<_>>();
            
            
            if true {
                package.sort_by(|x,y|{
                    if dp[present][x.2] > dp[present][y.2]{
                        cmp::Ordering::Less
                    }
                    else if dp[present][x.2] == dp[present][y.2]{
                        return y.0.cmp(&x.0);
                    }
                    else{
                        cmp::Ordering::Greater
                    }
                });
            }
            

            let mut tmp = package[package.len()-1];
            if ( false ) {
                let c1 = now + dp[present][tmp.2] - tmp.0;
                //let c1 = dp[present][tmp.2];
                for item in &tmp2{ //462849911334 //463169538529  
                    let c2 = now + dp[present][item.2] - item.0;
                    if c2 < c1 { continue};

                    //let c2 = dp[present][item.2];
                    //if c1.pow(2) > 700 && c2.pow(2) - c1.pow(2) > 1500 { // 463261653250  463261653250 
                    //if c1.pow(2) as f32 > maxcost as f32 * 9.7  && (c2.pow(2) - c1.pow(2)) as f32 > maxcost as f32 *20.8 {
                    //if c1 as f32 > maxcost.pow(3) as f32 * 3.6  && (c2 as i64 - c1 as i64) as f32 > maxcost.pow(3) as f32 *22.8 { //good
                    //if c1 as f32 > maxcost as f32 * 9.4  && (c2 as i64 - c1 as i64) as f32 > maxcost as f32 * 44.0 { //467553042321
                    //if c1 as f32 > maxcost as f32 * 9.4  && (c2 as i64 - c1 as i64) as f32 > maxcost as f32 * 44.6 { //467274690189
                    //if c1 as f32 > maxcost as f32 * 9.4  && (c2 as i64 - c1 as i64) as f32 > maxcost as f32 * 44.7 { //467281147454
                    //if c1 as f32 > maxcost as f32 * 9.3  && (c2 as i64 - c1 as i64) as f32 > maxcost as f32 * 44.7 { //467288159033
                    //if c1 as f32 > maxcost as f32 * 9.5  && (c2 as i64 - c1 as i64) as f32 > maxcost as f32 * 48.8 { //463169538529
                    if c1 as f32 > maxcost as f32 * 9.5  && (c2 as i64 - c1 as i64) as f32 > maxcost as f32 * 49.7 { //467314765776
                    
                    
                        mydbg!(c1,c2, c2-c1, maxcost);
                        mydbg!("swap!");
                        tmp = item.clone();
                        let index = package.iter().position(|x|{ x.0==tmp.0 && x.1==tmp.1 && x.2==tmp.2}).unwrap() as usize;
                        let l = package.len()-1;
                        package.swap(index,l);
                        break;
                    }
                    
                }
            }


            if(true){
                //if package.len() > 550 && now % maxcost *2 == 0{
                    package.sort_by(|x,y|{
                        let dtx = dp[present][x.2];
                        let dty = dp[present][y.2];
                        let wtx = now + dtx - x.0;
                        let wty = now + dty - y.0;
                        if wtx < wty{
                            cmp::Ordering::Less
                        }
                        else if wtx == wty{
                            cmp::Ordering::Equal
                        }
                        else{
                            cmp::Ordering::Greater
                        }
                    });
                    let l1 =package.len()-1;
                    let l2 = package.len()-1;
                    let hoge  = package[l1];
                    let hoge2 = package[0];
                    if package.len() > 400 && (now + dp[present][hoge.2] - hoge.0 ) > 1000  && now % (maxcost*3) == 0 {
                        mydbg!("特殊");
                        tmp = hoge;
                    }
                    else {
                        package.sort_by(|x,y|{
                            if dp[present][x.2] > dp[present][y.2]{
                                cmp::Ordering::Less
                            }
                            else if dp[present][x.2] == dp[present][y.2]{
                                return y.0.cmp(&x.0);
                            }
                            else{
                                cmp::Ordering::Greater
                            }
                        });
                        tmp = package[l1];
                    }
                    
                //}
            }


            
            
            if false {
                package.sort_by(|x,y|{
                    if dp[present][x.2] > dp[present][y.2]{
                        cmp::Ordering::Less
                    }
                    else if dp[present][x.2] == dp[present][y.2]{
                        return y.0.cmp(&x.0);
                    }
                    else{
                        cmp::Ordering::Greater
                    }
                });
                tmp = package[package.len()-1];

                if package.len() > 5 &&   dp[present][tmp.2] < 13 && now % 30 == 0 {
                    let l = package.len();
                    mydbg!(l);
                    package.swap(l-2, l-1);
                    tmp = package[package.len()-1];
                }
                
            }
            if false{
                package.sort_by(|x,y|{
                    if dp[present][x.2] > dp[present][y.2]{
                        cmp::Ordering::Less
                    }
                    else if dp[present][x.2] == dp[present][y.2]{
                        return y.0.cmp(&x.0);
                    }
                    else{
                        cmp::Ordering::Greater
                    }
                });
                
                let m = cmp::min(package.len(), 15);
                let m2 = cmp::min(package.len(), 6);
                let mut s= 100000;
                for i in 0..m{
                    let mut used = vec![0;package.len()];
                    let t = package[package.len()-i-1];
                    used[package.len()-i-1] = 1;
                    let mut root = vec![];
                    root.push(t);
                    let mut p = present;
                    p = t.2;
                    for _ in 0..m2{
                        let mut a= 100000;
                        let mut index = 0;
                        let m3 = cmp::min(used.len(), 50);
                        for j in 0..m3{
                            if used[j] != 0 { continue};
                            if a > dp[p][package[j].2]{
                                a = dp[p][package[j].2];
                                index = j;
                            }
                        }
                        used[index] = 1;
                        let t2 = package[index];
                        root.push(t2);
                        p = t2.2;
                        
                    }

                    let mut s2 = dp[present][root[0].2];
                    for j in 0..root.len()-1{
                        s2 += dp[root[j].2][root[j+1].2];
                    }
                    if s2 < s{
                        s = s2;
                        tmp = root[0];
                    }
                    
                }
                let l = package.len();
                let index = package.iter().position(|x|{x.0 == tmp.0 && x.1 == tmp.1 && x.2 == tmp.2}).unwrap();
                //mydbg!(l-1,index);
                package.swap(l-1, index);
            }
             if false{
                package.sort_by(|x,y|{
                    if dp[present][x.2] > dp[present][y.2]{
                        cmp::Ordering::Less
                    }
                    else if dp[present][x.2] == dp[present][y.2]{
                        return y.0.cmp(&x.0);
                    }
                    else{
                        cmp::Ordering::Greater
                    }
                });
                
                package.reverse();
                let m = cmp::min(package.len(), 4);
                let m2 = cmp::min(package.len(), 10 );
                let mut s= 100000000;
                for i in 0..m{
                    let mut used = vec![0;package.len()];
                    let t = package[i];
                    used[i] = 1;
                    let mut root = vec![];
                    root.push(t);
                    let mut p = present;
                    p = t.2;
                    let mut n = now;
                    for _ in 0..m2{
                        let mut a= 100000000;
                        let mut index = 0;
                        let m3 = cmp::min(used.len(), 40);
                        for j in 0..m3{
                            if used[j] != 0 { continue};
                            //if a > n + dp[p][package[j].2] - package[j].0 {
                            //    a =n + dp[p][package[j].2] - package[j].0;
                            if a > dp[p][package[j].2] {
                                a =dp[p][package[j].2];
                                index = j;
                            }
                        }
                        used[index] = 1;
                        let t2 = package[index];
                        root.push(t2);
                        n += dp[p][t2.2];
                        p = t2.2;
                        
                    }

                    n = now;
                    //let mut s2 = n+dp[present][root[0].2] - root[0].0;
                    //n += dp[present][root[0].2];
                    let mut s2 = dp[present][root[0].2];
                    for j in 0..root.len()-1{
                        //s2 += n + dp[root[j].2][root[j+1].2] - root[j+1].0;
                        s2 += dp[root[j].2][root[j+1].2];
                        n += dp[root[j].2][root[j+1].2] ;
                    }
                    if s2 < s{
                        s = s2;
                        tmp = root[0];
                    }
                    
                }
                package.reverse();
                let l = package.len();
                let index = package.iter().position(|x|{x.0 == tmp.0 && x.1 == tmp.1 && x.2 == tmp.2}).unwrap();
                //mydbg!(l-1,index);
                package.swap(l-1, index);
            }
      
      

            //mydbg!(tmp);
            let g = tmp.2;
            let mut target = present;
            //let g = 0;
            //let mut target = tmp.2;
            loop{
                target = next[target][g];
                path.push(target);
                if target == g{
                    break;
                }
            }

            //let mut b = present;
            'outer : for i in 0..path.len(){
                //mydbg!(b,*item,dp[b][*item]);
                let item = path[i];
                for _ in 0..dp[present][item]{
                    //ans.push(item as i32+1);
                    let tmp = post(&(item as i32+1).to_string(),bflag);
                    now += 1;
                    if now > tmax {
                        return;
                    }
                    if tmp == false{return};
                    let tmp = get_package(now,bflag);
                    for i in 0..tmp.len(){
                        info.push(tmp[i]);
                    }
                }
                present = item;
                //if i != path.len()-1 &&  dp[present][0] < dp[present][path[i+1]]{
                if i != path.len()-1{
                    //if (dp[present][0] < maxcost / 8 && info.len() > n/9 ) || 
                    //   (dp[present][0] as f32 * 0.8 < dp[present][path[i+1]] as f32 && info.len() > 5 ){ // 463168586749 good n/14
                    
                        //if (dp[present][0] < maxcost / 8 && info.len() > n/9 )|| (dp[present][0] < maxcost / 3  && info.len() > n/2) { //463030657950
                    if false {
                        //mydbg!("戻る");
                        loop{
                            let t = next[present][0];
                            for _ in 0..dp[present][t]{
                                //ans.push(t as i32+1);
                                let tmp = post(&(t as i32+1).to_string(),bflag);
                                now += 1;
                                if now > tmax {
                                    return;
                                }
                                if tmp == false{return};
                                let tmp = get_package(now,bflag);
                                for i in 0..tmp.len(){
                                    info.push(tmp[i]);
                                }
                            }
                            present = t;
                            if present == 0{
                                break;
                            }
                        }
                        break 'outer;
                    }
                }
            }

            package.pop();
            //mydbg!(package.len());
            if false  && present == 0 {
                break;
            }
            if package.len() == 0 {
            //if true { //一回配達するごとに絶対もどる
                //mydbg!("戻る2");
                loop{
                    let t = next[present][0];
                    for _ in 0..dp[present][t]{
                        //ans.push(t as i32+1);
                        let tmp = post(&(t as i32+1).to_string(),bflag);
                        now += 1;
                        if now > tmax {
                            return;
                        }
                        if tmp == false{return};
                        let tmp = get_package(now,bflag);
                        for i in 0..tmp.len(){
                            info.push(tmp[i]);
                        }
                    }
                    present = t;
                    if present == 0{
                        break;
                    }
                }
                break;
            }

            //if dp[present][0] < maxcost / 10  && dp[present][0]*2 < dp[present][package[package.len()-1].2]{
            //if (dp[present][0] < 10 && info.len() > 10 ) { //462982464483 good
            //if (dp[present][0] < 9 && info.len() > 25 ) || (dp[present][0] < 30 && info.len()> 120){ // 463069461709 good
            //if (dp[present][0] < maxcost / 8 && info.len() > 26 )|| (dp[present][0] < 30 && info.len()> 120) { //463069461709 good
            //if (dp[present][0] < maxcost / 8 && info.len() > 26 )|| (dp[present][0] < maxcost / 3  && info.len()> 90) { //463120523294 good
            //if (dp[present][0] < maxcost / 8 && info.len() > 26 )|| (dp[present][0] < maxcost / 3  && info.len()> 88) { //463121984399 good
            //if (dp[present][0] < maxcost / 8 && info.len() > n/9 )|| (dp[present][0] < maxcost / 3  && info.len() > n/2) { //463030657950
            //if (dp[present][0] < maxcost / 8 && info.len() > n/8 ) || (dp[present][0] < maxcost / 3  && info.len() > n/2) { //463030657950
            
            if ((tmax as f32  * 0.945 > now as f32) && (tmax as f32  * 0.96 < now as f32) ) && ( info.len() > 1 )
            || (tmax as f32  * 0.94 < now as f32) && (dp[present][0] < maxcost / 8 && info.len() > n/8 ) || (dp[present][0] < maxcost / 3  && info.len() > n/2) { //463030657950
            
            //if dp[present][0] < maxcost / 7 && info.len() > 13 { //462982464483 good
            //if dp[present][0] < 30 { //47137482026
            //if dp[present][0] < 60 { // 47333223951
            //if dp[present][0] < 50 { // 47137482026
            //if dp[present][0] < 70 { // 47333223951
            //if dp[present][0] < 90 { // 47333223951
            //if false {
                //mydbg!("戻る3");
                loop{
                    let t = next[present][0];
                    for _ in 0..dp[present][t]{
                        //ans.push(t as i32+1);
                        let tmp = post(&(t as i32+1).to_string(),bflag);
                        now += 1;
                        if now > tmax {
                            return;
                        }
                        if tmp == false{return};
                        let tmp = get_package(now,bflag);
                        for i in 0..tmp.len(){
                            info.push(tmp[i]);
                        }
                    }
                    present = t;
                    if present == 0{
                        break;
                    }
                }
                time = ans.len();
                break;
            }
            
            
            time = ans.len();
        }

        time = ans.len();

    }

 
 



}



Measured memory_bytes: 6524