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 N = 200100;
int n, sub[N], w[N];
double der[N], dissum[N];
bool vis[N];
int solv = -1;
double solsum;
vector<pair<int, int> > adj[N];
inline void init(int v, int p, int gp, double d) {
  dissum[gp] += d * sqrt(d) * (double)w[v];
  der[gp] += sqrt(d) * (double)w[v];
  int u;
  for (pair<int, int> to : adj[v]) {
    u = to.first;
    if (u != p) init(u, v, gp, d + to.second);
  }
}
inline int check(int v) {
  double sum = 0.0;
  double best = -1.0;
  int ans = -1, u;
  for (pair<int, int> to : adj[v]) {
    u = to.first;
    dissum[u] = der[u] = 0.0;
    init(u, v, u, to.second);
    sum += dissum[u];
    if (der[u] > best) {
      best = der[u];
      ans = u;
    }
  }
  if (solv == -1 || sum < solsum) {
    solv = v;
    solsum = sum;
  }
  return ans;
}
inline void dfs(int v, int p = -1) {
  sub[v] = 1;
  int u;
  for (pair<int, int> to : adj[v]) {
    u = to.first;
    if (u != p && !vis[u]) {
      dfs(u, v);
      sub[v] += sub[u];
    }
  }
}
inline int findCent(int x) {
  dfs(x);
  int cap = sub[x] >> 1;
  int u, p = -1;
  for (;;) {
    bool found = 0;
    for (pair<int, int> to : adj[x]) {
      u = to.first;
      if (!vis[u] && u != p && sub[u] > cap) {
        p = x;
        x = u;
        found = 1;
        break;
      }
    }
    if (!found) return x;
  }
  assert(0);
}
inline void solve(int v) {
  int cent = findCent(v);
  int u = check(cent);
  vis[cent] = 1;
  if (u != -1 && !vis[u]) solve(u);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", w + i);
  int a, b, l;
  for (int i = 1; i < n; i++) {
    scanf("%d%d%d", &a, &b, &l);
    adj[a].push_back(pair<int, int>(b, l));
    adj[b].push_back(pair<int, int>(a, l));
  }
  solsum = 0.0;
  memset(vis, 0, sizeof vis);
  solve(1);
  printf("%d %.12f\n", solv, solsum);
  return 0;
}
