Let H be a complete undirected graph with 6 edges having a distinct weight from 1, 3, 9, 27, 81 and 243. The maximum possible weight that a minimum spanning tree of H can have is ________.
Enter numerical value using the virtual keypad. Round off where necessary.