3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200100;
int N;
vector<pair<int, int> > edge[MAXN];
bool bad[MAXN];
int w[MAXN];
int ssize[MAXN];
int par[MAXN];
double res;
void gflood(int cloc, int last, double tot) {
  res += tot * sqrt(tot) * w[cloc];
  for (int i = 0; i < edge[cloc].size(); i++) {
    int neigh = edge[cloc][i].first;
    if (neigh == last) continue;
    gflood(neigh, cloc, tot + edge[cloc][i].second);
  }
}
double get(int loc) {
  res = 0;
  gflood(loc, -1, 0);
  return res;
}
vector<int> v;
void flood(int cloc, int last) {
  v.push_back(cloc);
  ssize[cloc] = 1;
  par[cloc] = last;
  for (int i = 0; i < edge[cloc].size(); i++) {
    int neigh = edge[cloc][i].first;
    if (neigh == last || bad[neigh]) continue;
    flood(neigh, cloc);
    ssize[cloc] += ssize[neigh];
  }
}
int runs;
int solve(int loc) {
  runs++;
  v.clear();
  flood(loc, -1);
  if (v.size() == 1) return loc;
  int bloc = -1, btot = -1;
  for (int i = 0; i < v.size(); i++) {
    int p = v[i];
    if (ssize[p] <= v.size() / 2 && ssize[p] > btot) {
      btot = ssize[p];
      bloc = p;
    }
  }
  int a = bloc, b = par[bloc];
  if (get(a) > get(b)) swap(a, b);
  bad[b] = true;
  if (runs > 70) return a;
  return solve(a);
}
int main() {
  ios_base::sync_with_stdio(0);
  for (int i = 0; i < MAXN; i++) bad[i] = false;
  cin >> N;
  for (int i = 0; i < N; i++) cin >> w[i];
  for (int i = 0; i < N - 1; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    a--, b--;
    edge[a].push_back(make_pair(b, c));
    edge[b].push_back(make_pair(a, c));
  }
  runs = 0;
  int ans = solve(0);
  cout << fixed << setprecision(9);
  cout << ans + 1 << " " << get(ans) << "\n";
  return 0;
}
