Dijkstra Algorithm Implementation Does Not Work Properly

I have to implement Dijkstra algorithm in Java.

Input file looks like this:

3
5
1 5 1
4 5 3
3 4 5
4 3 7
1 6 9
2 5 12
2 6 3
5 4 4

First and second numbers are in order source and destination points.

First and second numbers in another each line represent edges. Third one is wage of each edge.

My code looks as follows:

import java.util.*;
import java.io.*;
class Vertex implements Comparable<Vertex>
{
public int name = 0;
public ArrayList<Edge> adjacencies = new ArrayList<Edge>();
public double minDistance = Double.POSITIVE_INFINITY;
public Vertex previous;

[Code] .....