object Main {
  def main(args: Array[String]): Unit = {
    val s = new Main()
    s.solve()
    s.out.flush()
  }
}

class Main {
  import java.io._
  import java.util.StringTokenizer

  import scala.collection.mutable
  import scala.util.Sorting
  import math.{abs, max, min}
  import mutable.{ArrayBuffer, ListBuffer}
  import scala.reflect.ClassTag

  val MOD = 1000000007
  val out = new PrintWriter(System.out)

  def solve(): Unit = {
    val N, M = ni()

    case class Edge(v: Long, w: Int)

    // 会社に属さないノードは 駅id
    // 会社に属するノードは 会社id * 1e6 + 駅id
    val g: mutable.Map[Long, ArrayBuffer[Edge]] = mutable.Map().withDefaultValue(ArrayBuffer.empty)

    // 方向あるよ
    def joint(from: Long, to: Long, w: Int): Unit = {
      if (!g.contains(from)) g(from) = ArrayBuffer()
      g(from) += Edge(to, w)
    }

    REP(M) { _ =>
      val from, to = ni() - 1
      val c = ni()
      val fromC = from + c * 1e6.toLong
      val toC = to + c * 1e6.toLong

      joint(fromC, toC, 0)
      joint(toC, fromC, 0)
      joint(from, fromC, 1) // 乗るのは1
      joint(fromC, from, 0) // 降りるのは0
      joint(to, toC, 1)
      joint(toC, to, 0)
    }

//    g.toSeq.sortBy(_._1).foreach { case (v, es) =>
//      debug(s"$v ${es.mkString}")
//    }

    val INF = Integer.MAX_VALUE / 2
    def dijk(start: Long, dest: Long): Int = {
      import java.util
      val d = mutable.Map[Long, Int]().withDefaultValue(INF)
      case class Visit(node: Long, cost: Int)
      val queue = new util.ArrayDeque[Visit]()
      d(start) = 0
      queue.add(Visit(start, 0))

      while(!queue.isEmpty) {
        val v = queue.poll()
        if (d(v.node) == v.cost) {
          val es = g(v.node)
          REP(es.length) { i =>
            val e = es(i)
            val next = v.cost + e.w
            if (d(e.v) > next) {
              d(e.v) = next
              if (e.w == 0) queue.addFirst(Visit(e.v, next))
              else queue.addLast(Visit(e.v, next))
            }
          }
        }
      }

//      d.toSeq.sortBy(_._1).foreach { case (v, cost) =>
//          debug(s"$v $cost")
//      }

      d(dest)
    }

    val ans = dijk(0, N - 1)
    if (ans == INF) out.println(-1)
    else out.println(ans)
  }


  def debug(as: Array[Boolean]): Unit = {
    System.err.println(as.map(x => if(x) "1" else "0").mkString)
  }

  def debug(as: Array[Int]): Unit = {
    System.err.println(as.mkString(" "))
  }

  def debug(as: Array[Long]): Unit = {
    System.err.println(as.mkString(" "))
  }

  def debug(s: String): Unit = {
    System.err.println(s)
  }

  def debug(num: Long): Unit = {
    System.err.println(num)
  }

  class InputReader(val stream: InputStream) {
    private val reader = new BufferedReader(new InputStreamReader(stream), 32768)
    private var tokenizer: StringTokenizer = _

    def next(): String = {
      while (tokenizer == null || !tokenizer.hasMoreTokens)
        tokenizer = new StringTokenizer(reader.readLine)
      tokenizer.nextToken
    }

    def nextInt(): Int = next().toInt
    def nextLong(): Long = next().toLong
    def nextChar(): Char = next().charAt(0)
  }
  val sc = new InputReader(System.in)
  def ni(): Int = sc.nextInt()
  def nl(): Long = sc.nextLong()
  def nc(): Char = sc.nextChar()
  def ns(): String = sc.next()
  def ns(n: Int): Array[Char] = ns().toCharArray
  def na(n: Int, offset: Int = 0): Array[Int] = map(n)(_ => ni() + offset)
  def na2(n: Int, offset: Int = 0): (Array[Int], Array[Int]) = {
    val A1, A2 = Array.ofDim[Int](n)
    REP(n) { i =>
      A1(i) = ni() + offset
      A2(i) = ni() + offset
    }
    (A1, A2)
  }
  def nm(n: Int, m: Int): Array[Array[Int]] = {
    val A = Array.ofDim[Int](n, m)
    REP(n) { i =>
      REP(m) { j =>
        A(i)(j) = ni()
      }
    }
    A
  }
  def nal(n: Int): Array[Long] = map(n)(_ => nl())
  def nm_c(n: Int, m: Int): Array[Array[Char]] = map(n) (_ => ns(m))
  def REP(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = offset
    val N = n + offset
    while(i < N) { f(i); i += 1 }
  }
  def REP_r(n: Int, offset: Int = 0)(f: Int => Unit): Unit = {
    var i = n - 1 + offset
    while(i >= offset) { f(i); i -= 1 }
  }

  def map[@specialized A: ClassTag](n: Int, offset: Int = 0)(f: Int => A): Array[A] = {
    val res = Array.ofDim[A](n)
    REP(n)(i => res(i) = f(i + offset))
    res
  }


  def sumL(as: Array[Int]): Long = {
    var s = 0L
    REP(as.length)(i => s += as(i))
    s
  }

  def cumSum(as: Array[Int]) = {
    val cum = Array.ofDim[Long](as.length + 1)
    REP(as.length) { i =>
      cum(i + 1) = cum(i) + as(i)
    }
    cum
  }
}
