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>
const int MN = 200005;
int N, wgh[MN];
std::vector<std::pair<int, int>> G[MN];
int Ansu;
double Ans, now;
int vis[MN], siz[MN], Rt, tsz, rsz;
void GetRt(int u, int fz) {
  siz[u] = 1;
  int mxs = 0;
  for (auto e : G[u]) {
    int v = e.first;
    if (v == fz) continue;
    if (vis[v]) continue;
    GetRt(v, u);
    siz[u] += siz[v];
    mxs = std::max(mxs, siz[v]);
  }
  mxs = std::max(mxs, tsz - siz[u]);
  if (mxs < rsz) Rt = u, rsz = mxs;
}
double DFS(int u, int fz, long long dis) {
  double sum = wgh[u] * sqrt(dis);
  now += (double)wgh[u] * dis * sqrt(dis);
  for (auto e : G[u]) {
    int v = e.first;
    int l = e.second;
    if (v == fz) continue;
    sum += DFS(v, u, dis + l);
  }
  return sum;
}
void Solve(int u) {
  static double vals[MN];
  int tp = 0;
  double sval = 0;
  now = 0;
  for (auto e : G[u]) {
    int v = e.first;
    int l = e.second;
    vals[++tp] = DFS(v, u, l);
    sval += vals[tp];
  }
  if (now < Ans) Ans = now, Ansu = u;
  vis[u] = 1;
  tp = 0;
  for (auto e : G[u]) {
    int v = e.first;
    if (sval - 2 * vals[++tp] < 0) {
      if (!vis[v]) {
        rsz = tsz = siz[v] < siz[u] ? siz[v] : tsz - siz[u];
        GetRt(v, u), Solve(Rt);
      }
      return;
    }
  }
}
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; ++i) scanf("%d", &wgh[i]);
  for (int i = 1, x, y, z; i < N; ++i) {
    scanf("%d%d%d", &x, &y, &z);
    G[x].push_back({y, z});
    G[y].push_back({x, z});
  }
  Ans = 1e99;
  rsz = tsz = N, GetRt(1, 0), Solve(Rt);
  printf("%d %.15lf\n", Ansu, Ans);
  return 0;
}
