func Solution(N int, A []int, B []int) bool {
    // write your code in Go 1.4

    consecEdges := make(map[int]int)

    for i, vert := range A {
        if math.Abs(float64(vert - B[i])) == 1 {
            if vert < B[i] {
                consecEdges[vert] = B[i]
            } else {
                consecEdges[B[i]] = vert
            }
        }
    }

    return len(consecEdges) == (N - 1)
}